References in zbMATH (referenced in 26 articles , 1 standard article )

Showing results 1 to 20 of 26.
Sorted by year (citations)

1 2 next

  1. Marzban, Marjan; Gu, Qian-Ping; Jia, Xiaohua: New analysis and computational study for the planar connected dominating set problem (2016)
  2. Tamassia, Roberto (ed.): Handbook of graph drawing and visualization (2014)
  3. de Fraysseix, Hubert; Ossona de Mendez, Patrice: Trémaux trees and planarity (2012)
  4. Hong, Seok-Hee; Nagamochi, Hiroshi: A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs (2010)
  5. Chimani, Markus; Gutwenger, Carsten: Non-planar core reduction of graphs (2009)
  6. Bhowmick, Sanjukta; Hovland, Paul D.: A polynomial-time algorithm for detecting directed axial symmetry in Hessian computational graphs (2008)
  7. Buchheim, Christoph; Chimani, Markus; Ebner, Dietmar; Gutwenger, Carsten; Jünger, Michael; Klau, Gunnar W.; Mutzel, Petra; Weiskircher, René: A branch-and-cut approach to the crossing number problem (2008)
  8. Buchheim, Christoph; Hong, Seok-Hee: Testing planarity of geometric automorphisms in linear time (2008)
  9. Chimani, Markus; Mutzel, Petra; Schmidt, Jens M.: Efficient extraction of multiple Kuratowski subdivisions (2008)
  10. De Fraysseix, Hubert: Trémaux trees and planarity (2008)
  11. Mutzel, Petra: Recent advances in exact crossing minimization (extended abstract) (2008)
  12. Nešetřil, Jaroslav; Ossona de Mendez, Patrice: Grad and classes with bounded expansion. I: Decompositions (2008)
  13. Abelson, David; Hong, Seok-Hee; Taylor, D.E.: Geometric automorphism groups of graphs (2007)
  14. de Fraysseix, Hubert; Ossona de Mendez, Patrice; Rosenstiehl, Pierre: Trémaux trees and planarity (2006)
  15. Hong, Seok-Hee; Eades, Peter: Drawing planar graphs symmetrically. III: Oneconnected planar graphs (2006)
  16. Hong, Seok-Hee; McKay, Brendan; Eades, Peter: A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs (2006)
  17. Hong, Seok-Hee; Eades, Peter: Drawing planar graphs symmetrically. II: Biconnected planar graphs (2005)
  18. Boyer, John M.; Cortese, Pier Francesco; Patrignani, Maurizio; Di Battista, Giuseppe: Stop minding your P’s and Q’s: Implementing a fast and simple DFS-based planarity testing and embedding algorithm (2004)
  19. Hong, Seok-Hee; Eades, Peter; Hillman, Jonathan: Linkless symmetric drawings of series parallel digraphs (2004)
  20. de Fraysseix, Hubert; Ossona de Mendez, Patrice: On cotree-critical and DFS cotree-critical graphs (2003)

1 2 next


Further publications can be found at: http://pigale.sourceforge.net/bibliography.html