Search results for "Planarity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
93	John M. Boyer	Additional PC-Tree Planarity Conditions.	GD	2004	DBLP DOI BibTeX RDF
93	Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher	Advances in C-Planarity Testing of Clustered Graphs.	GD	2002	DBLP DOI BibTeX RDF
81	Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia	Optimal Upward Planarity Testing of Single-Source Digraphs.	ESA	1993	DBLP DOI BibTeX RDF
78	Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo	Quasi-Upward Planarity.	Algorithmica	2002	DBLP DOI BibTeX RDF	Upward, Flow techniques, Branch and bound, Planarity
68	Patrick Healy, Karol Lynch	Fixed-Parameter Tractable Algorithms for Testing Upward Planarity.	SOFSEM	2005	DBLP DOI BibTeX RDF
68	Hubert Y. Chan 0002	A Parameterized Algorithm for Upward Planarity Testing.	ESA	2004	DBLP DOI BibTeX RDF
68	Michael Forster, Christian Bachmaier	Clustered Level Planarity.	SOFSEM	2004	DBLP DOI BibTeX RDF
68	Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster	Radial Level Planarity Testing and Embedding in Linear Time.	GD	2003	DBLP DOI BibTeX RDF
68	Michael Jünger, Sebastian Leipert, Petra Mutzel	Level Planarity Testing in Linear Time.	GD	1998	DBLP DOI BibTeX RDF
66	Zvi Galil, Giuseppe F. Italiano, Neil Sarnak	Fully Dynamic Planarity Testing with Applications.	J. ACM	1999	DBLP DOI BibTeX RDF	planarity testing, planar graphs, dynamic graph algorithms
59	Monika Rauch Henzinger, Michael L. Fredman	Lower Bounds for Fully Dynamic Connectivity Problems in Graphs.	Algorithmica	1998	DBLP DOI BibTeX RDF	Dynamic planarity testing, Dynamic connectivity testing, Dynamic planarity testing, Dynamic connectivity testing, Lower bounds, Lower bounds, Key words, Cell probe model, Cell probe model
55	Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan	Planarity, Determinants, Permanents, and (Unique) Matchings.	CSR	2007	DBLP DOI BibTeX RDF
55	Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun	C-Planarity of Extrovert Clustered Graphs.	GD	2005	DBLP DOI BibTeX RDF
55	Walter Didimo, Francesco Giordano, Giuseppe Liotta	Upward Spirality and Upward Planarity Testing.	GD	2005	DBLP DOI BibTeX RDF
55	Eric Allender, Meena Mahajan	The Complexity of Planarity Testing.	STACS	2000	DBLP DOI BibTeX RDF
55	Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov	Planarity-Preserving Clustering and Embedding for Large Planar Graphs.	GD	1999	DBLP DOI BibTeX RDF
55	Qing-Wen Feng, Robert F. Cohen, Peter Eades	Planarity for Clustered Graphs.	ESA	1995	DBLP DOI BibTeX RDF
55	Jeffery R. Westbrook	Fast Incremental Planarity Testing.	ICALP	1992	DBLP DOI BibTeX RDF
53	Christoph Buchheim, Seok-Hee Hong 0001	Testing Planarity of Geometric Automorphisms in Linear Time.	Algorithmica	2008	DBLP DOI BibTeX RDF	Symmetries, Graph drawing, Planarity, Automorphisms
51	Boris Klemz, Günter Rote	Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity.	ACM Trans. Algorithms	2019	DBLP DOI BibTeX RDF
43	Sarmad Abbasi, Patrick Healy, Aimal Rextin	An Improved Upward Planarity Testing Algorithm and Related Applications.	WALCOM	2009	DBLP DOI BibTeX RDF
43	Walter Didimo, Francesco Giordano, Giuseppe Liotta	Overlapping cluster planarity.	APVIS	2007	DBLP DOI BibTeX RDF
43	Giuseppe Di Battista, Fabrizio Frati	Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces.	GD	2007	DBLP DOI BibTeX RDF
43	John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina	Lempel, Even, and Cederbaum Planarity Method.	WEA	2004	DBLP DOI BibTeX RDF
43	Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner	Planarity of the 2-Level Cactus Model.	WG	2001	DBLP DOI BibTeX RDF
43	Günter Hotz, Steffen Lohse	Planarity Testing of Graphs on Base of a Spring Model.	GD	2001	DBLP DOI BibTeX RDF
43	Giuseppe Di Battista, Giuseppe Liotta	Upward Planarity Checking: "Faces Are More than Polygons".	GD	1998	DBLP DOI BibTeX RDF
40	Ken-ichi Kawarabayashi	Planarity Allowing Few Error Vertices in Linear Time.	FOCS	2009	DBLP DOI BibTeX RDF	Few errors, Approximation Algorithms, TSP, Planarity, linear time
40	Pier Francesco Cortese, Giuseppe Di Battista	Clustered planarity.	SCG	2005	DBLP DOI BibTeX RDF	cluster, graph drawing, planarity
40	Vijaya Ramachandran, John H. Reif	An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	graph planarity, open ear decomposition, embedding, graph connectivity, CRCW PRAM, optimal parallel algorithm
40	Giuseppe Di Battista, Roberto Tamassia	Incremental Planarity Testing (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	edge insertions, incremental planarity testing, supports tests, vertex insertions, queries, planar graph, edges, vertices, insertion
38	Chao-I Chen, Dusty Sargent, Chang-Ming Tsai, Yuan-Fang Wang, Dan Koppel	Stabilizing Stereo Correspondence Computation Using Delaunay Triangulation and Planar Homography.	ISVC (1)	2008	DBLP DOI BibTeX RDF
38	Wen-Lian Hsu	A Linear Time Algorithm For Finding Maximal Planar Subgraphs.	ISAAC	1995	DBLP DOI BibTeX RDF
38	Giuseppe Di Battista, Roberto Tamassia, Luca Vismara	On-Line Convex Plabarity Testing.	WG	1994	DBLP DOI BibTeX RDF
36	Youngmin Kim, Dusan Petranovic, Dennis Sylvester	Simple and Accurate Models for Capacitance Increment due to Metal Fill Insertion.	ASP-DAC	2007	DBLP DOI BibTeX RDF	capacitance increment, metal fill insertion, inter level dielectric thickness planarity, metal dummy, signal capacitance, electrical characteristic, signal dimensions, dummy shape, dummy dimensions, simple test patterns, benchmark circuits, weighting function
36	Valentin E. Brimkov, Reneta P. Barneva	Digital Flatness.	DGCI	2003	DBLP DOI BibTeX RDF	Digital planarity, 2D Sturmian word, periodic array, digitization of planes, slope of digital planes
34	Thomas Bläsius, Simon D. Fink, Ignaz Rutter	Synchronized Planarity with Applications to Constrained Planarity Problems.	ACM Trans. Algorithms	2023	DBLP DOI BibTeX RDF
34	Simon D. Fink, Ignaz Rutter	Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm.	CoRR	2023	DBLP DOI BibTeX RDF
34	Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph 0001, Alessandra Tappini	(k, p)-planarity: A relaxation of hybrid planarity.	Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
34	Thomas Bläsius, Simon D. Fink, Ignaz Rutter	Synchronized Planarity with Applications to Constrained Planarity Problems.	ESA	2021	DBLP DOI BibTeX RDF
34	Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter	Beyond level planarity: Cyclic, torus, and simultaneous level planarity.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
34	Thomas Bläsius, Simon D. Fink, Ignaz Rutter	Synchronized Planarity with Applications to Constrained Planarity Problems.	CoRR	2020	DBLP BibTeX RDF
34	Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph 0001, Alessandra Tappini	(k, p)-Planarity: A Relaxation of Hybrid Planarity.	WALCOM	2019	DBLP DOI BibTeX RDF
34	Pier Francesco Cortese, Maurizio Patrignani	Clustered Planarity = Flat Clustered Planarity.	CoRR	2018	DBLP BibTeX RDF
34	Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph 0001, Alessandra Tappini	(k, p)-Planarity: A Generalization of Hybrid Planarity.	CoRR	2018	DBLP BibTeX RDF
34	Pier Francesco Cortese, Maurizio Patrignani	Clustered Planarity = Flat Clustered Planarity.	GD	2018	DBLP DOI BibTeX RDF
34	Boris Klemz, Günter Rote	Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity.	CoRR	2017	DBLP BibTeX RDF
34	Boris Klemz, Günter Rote	Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity.	GD	2017	DBLP DOI BibTeX RDF
34	Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli	The importance of being proper: (In clustered-level planarity and T-level planarity).	Theor. Comput. Sci.	2015	DBLP DOI BibTeX RDF
34	Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli	On the Complexity of Clustered-Level Planarity and T-Level Planarity.	CoRR	2014	DBLP BibTeX RDF
34	Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli	The Importance of Being Proper - (In Clustered-Level Planarity and T-Level Planarity).	GD	2014	DBLP DOI BibTeX RDF
34	Marcus Schaefer 0001	Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants.	J. Graph Algorithms Appl.	2013	DBLP DOI BibTeX RDF
34	Marcus Schaefer 0001	Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants.	GD	2012	DBLP DOI BibTeX RDF
30	Vít Jelínek, Jan Kratochvíl, Ignaz Rutter	A kuratowski-type theorem for planarity of partially embedded graphs.	SCG	2011	DBLP DOI BibTeX RDF
30	Peter Eades	Some Constrained Notions of Planarity.	ISAAC	2008	DBLP DOI BibTeX RDF
30	Christian Bachmaier, Wolfgang Brunner	Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs.	ESA	2008	DBLP DOI BibTeX RDF
30	Marc Rodríguez 0001, Gaëlle Largeteau-Skapin, Eric Andres	Local Non-planarity of Three Dimensional Surfaces for an Invertible Reconstruction: k-Cuspal Cells.	ISVC (1)	2008	DBLP DOI BibTeX RDF
30	Vladimir P. Korzhik, Bojan Mohar	Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing.	GD	2008	DBLP DOI BibTeX RDF
30	Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický	Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters.	GD	2008	DBLP DOI BibTeX RDF
30	Vít Jelínek, Ondrej Suchý, Marek Tesar 0001, Tomás Vyskocil	Clustered Planarity: Clusters with Few Outgoing Edges.	GD	2008	DBLP DOI BibTeX RDF
30	Aimal Rextin, Patrick Healy	A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs.	GD	2008	DBLP DOI BibTeX RDF
30	Martin Harrigan, Patrick Healy	Practical Level Planarity Testing and Layout with Embedding Constraints.	GD	2007	DBLP DOI BibTeX RDF
30	Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil	Clustered Planarity: Small Clusters in Eulerian Graphs.	GD	2007	DBLP DOI BibTeX RDF
30	Christian Zschalig	Planarity of Lattices.	ICFCA	2005	DBLP DOI BibTeX RDF
30	John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista	Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm.	GD	2003	DBLP DOI BibTeX RDF
30	János Pach, Rados Radoicic, Géza Tóth 0001	Relaxing Planarity for Topological Graphs.	JCDCG	2002	DBLP DOI BibTeX RDF
30	Robin Thomas 0001	Graph Planarity and Related Topics.	GD	1999	DBLP DOI BibTeX RDF
30	Giuseppe F. Italiano, Johannes A. La Poutré, Monika Rauch	Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract).	ESA	1993	DBLP DOI BibTeX RDF
30	Thomas Lengauer	Hierarchical planarity testing algorithms.	J. ACM	1989	DBLP DOI BibTeX RDF
30	P. Sreenivasa Kumar, C. E. Veni Madhavan	A New Class of Separators and Planarity of Chordal Graphs.	FSTTCS	1989	DBLP DOI BibTeX RDF
30	Giuseppe Di Battista, Enrico Nardelli	An Algorithm for Testing Planarity of Hierarchical Graphs.	WG	1986	DBLP DOI BibTeX RDF
30	Joseph F. JáJá, Janos Simon	Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version).	MFCS	1980	DBLP DOI BibTeX RDF
30	Narsingh Deo	Note on Hopcroft and Tarjan's Planarity Algorithm.	J. ACM	1976	DBLP DOI BibTeX RDF
25	Haim Kaplan, Yahav Nussbaum	Maximum Flow in Directed Planar Graphs with Vertex Capacities.	ESA	2009	DBLP DOI BibTeX RDF
25	Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein 0001, Petra Mutzel	Computing Maximum C-Planar Subgraphs.	GD	2008	DBLP DOI BibTeX RDF
25	Tae Eun Choe, Gérard G. Medioni	3-D Metric Reconstruction and Registration of Images of Near-planar Surfaces.	ICCV	2007	DBLP DOI BibTeX RDF
25	Markus Chimani, Petra Mutzel, Jens M. Schmidt	Efficient Extraction of Multiple Kuratowski Subdivisions.	GD	2007	DBLP DOI BibTeX RDF
25	Anna Lubiw, Mark Petrick, Michael J. Spriggs	Morphing orthogonal planar graph drawings.	SODA	2006	DBLP DOI BibTeX RDF
25	Nutan Limaye, Meena Mahajan, Jayalal Sarma	Evaluating Monotone Circuits on Cylinders, Planes and Tori.	STACS	2006	DBLP DOI BibTeX RDF
25	Herman J. Haverkort, Laura Toma	I/O-Efficient Algorithms on Near-Planar Graphs.	LATIN	2006	DBLP DOI BibTeX RDF
25	Carsten Gutwenger, Markus Chimani	Non-planar Core Reduction of Graphs.	GD	2005	DBLP DOI BibTeX RDF
25	Wen-Lian Hsu	A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees.	COCOON	2005	DBLP DOI BibTeX RDF
25	Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia	Clustering Cycles into Cycles of Clusters.	GD	2004	DBLP DOI BibTeX RDF
25	Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou	Map graphs.	J. ACM	2002	DBLP DOI BibTeX RDF	maps, topological inference, Map graphs
25	Wen-Lian Hsu	PC-Trees vs. PQ-Trees.	COCOON	2001	DBLP DOI BibTeX RDF
25	Mehmet Aktuna, Rob A. Rutenbar, L. Richard Carley	Device-level early floorplanning algorithms for RF circuits.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1999	DBLP DOI BibTeX RDF
25	Michael Jünger, Sebastian Leipert	Level Planar Embedding in Linear Time.	GD	1999	DBLP DOI BibTeX RDF
25	Patrick Healy, Ago Kuusik	The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation.	GD	1999	DBLP DOI BibTeX RDF
25	Mehmet Aktuna, Rob A. Rutenbar, L. Richard Carley	Device-level early floorplanning algorithms for RF circuits.	ISPD	1998	DBLP DOI BibTeX RDF
23	Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani	On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Topology-shape-metrics approach, Graph Drawing, Planarity, Orthogonal drawings
23	Xiaojuan Ning, Xiaopeng Zhang 0001, Yinghui Wang, Marc Jaeger 0002	Segmentation of architecture shape information from 3D point cloud.	VRCAI	2009	DBLP DOI BibTeX RDF	urban scenes, architectures, segmentation, point cloud, planarity, residual
23	Kristoffer Arnsfelt Hansen	Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size.	CCC	2008	DBLP DOI BibTeX RDF	Constant Width, Circuits, Planarity, Branching Programs
23	Stefan Funke, Theocharis Malamatos, Rahul Ray	Finding planar regions in a terrain: in practice and with a guarantree.	SCG	2004	DBLP DOI BibTeX RDF	approximation, terrain, planarity
23	Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani	Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph	FOCS	1989	DBLP DOI BibTeX RDF	disjoint paths problem, Kuratowski homeomorph, vertex-disjoint paths, NC planarity algorithms, processor-time product, routing, parallel algorithms, sequential algorithm, planar embedding, polylogarithmic factor
17	Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho	The maximum linear arrangement problem for trees under projectivity and planarity.	Inf. Process. Lett.	2024	DBLP DOI BibTeX RDF
17	Weichan Liu, Guiying Yan	Weak-Dynamic Coloring of Graphs Beyond-Planarity.	Graphs Comb.	2024	DBLP DOI BibTeX RDF
17	Václav Blazej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff 0001, Johannes Zink 0001	Constrained and Ordered Level Planarity Parameterized by the Number of Levels.	CoRR	2024	DBLP DOI BibTeX RDF
17	Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Marie Diana Sieper	Clustered Planarity Variants for Level Graphs.	CoRR	2024	DBLP DOI BibTeX RDF
17	Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer 0001	Hanani-Tutte for Radial Planarity II.	Electron. J. Comb.	2023	DBLP DOI BibTeX RDF
17	Azzurra Ciliberti, Luca Moci	On Chromatic Symmetric Homology and Planarity of Graphs.	Electron. J. Comb.	2023	DBLP DOI BibTeX RDF