The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase planar graphs (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1970-1976 (15) 1977-1981 (22) 1982-1983 (15) 1984-1985 (24) 1986 (18) 1987 (19) 1988 (19) 1989 (22) 1990 (24) 1991 (42) 1992 (23) 1993 (37) 1994 (34) 1995 (28) 1996 (43) 1997 (32) 1998 (40) 1999 (51) 2000 (36) 2001 (70) 2002 (58) 2003 (60) 2004 (74) 2005 (82) 2006 (87) 2007 (102) 2008 (125) 2009 (136) 2010 (100) 2011 (126) 2012 (120) 2013 (114) 2014 (119) 2015 (102) 2016 (130) 2017 (138) 2018 (130) 2019 (43)
Publication types (Num. hits)
article(1567) incollection(12) inproceedings(873) phdthesis(7) proceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 540 occurrences of 284 keywords

Results
Found 2460 publication records. Showing 2460 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
106Seok-Hee Hong, Peter Eades Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Planar geometric automorphisms, Symmetry, Graph drawing, Planar graphs
94Zhi-Zhong Chen, Mitsuharu Kouno A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Plane embeddings, Plane embeddings, NP-completeness, Graph algorithms, Planar graphs, Planar graphs, Vertex coloring
85Fedor V. Fomin, Dimitrios M. Thilikos A Simple and Fast Approach for Solving Problems on Planar Graphs. Search on Bibsonomy STACS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
82MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Steiner forest, bounded-genus graphs, bounded-treewidth graphs, planar graphs, PTAS, series-parallel graphs
80Zhengbing Bian, Qian-Ping Gu Computing Branch Decomposition of Large Planar Graphs. Search on Bibsonomy WEA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF computational study, Graph algorithms, planar graphs, algorithm engineering, branch-decomposition
80Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty 0001, Samir Datta, Sambuddha Roy Planar and Grid Graph Reachability Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Logspace, Algorithms, Planar graphs, Reachability, Complexity theory, Circuit complexity, Grid graphs
73Mitsuharu Yamamoto, Shin-ya Nishizaki, Masami Hagiya, Yozo Toda Formalization of Planar Graphs. Search on Bibsonomy TPHOLs The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
72Seok-Hee Hong, Peter Eades Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Symmetry, Graph drawing, Planar graphs, Graph automorphism
68Wen-Lian Hsu Recognizing planar perfect graphs. Search on Bibsonomy J. ACM The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
67Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF (k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph
67Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
64Seok-Hee Hong, Peter Eades, Sang Ho Lee Finding Planar Geometric Automorphisms in Planar Graphs. Search on Bibsonomy ISAAC The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
64Tiziana Calamoneri, Rossella Petreschi L(2, 1)-labeling of planar graphs. Search on Bibsonomy DIAL-M The full citation details ... 2001 DBLP  DOI  BibTeX  RDF L(2, 1)-labeling, planar graphs, outerplanar graphs, multi-hop radio networks
64Muhammad Rezaul Karim 0001, Md. Saidur Rahman 0001 Straight-line grid drawings of planar graphs with linear area. Search on Bibsonomy APVIS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
63Xiuzhen Huang, Jianer Chen On PTAS for Planar Graph Problems. Search on Bibsonomy IFIP TCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
63Samir Khuller, Joseph Naor Flow in Planar Graphs: A Survey of Results. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
63Fan R. K. Chung, David Mumford Chordal Completions of Grids and Planar Graphs. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
63Dan Archdeacon, C. Paul Bonnington, Charles H. C. Little Cycles, Cocycles and Diagonals: A Characterization of Planar Graphs. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
63Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk Stack and Queue Layouts of Directed Planar Graphs. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
63Douglas B. West, Tood Will Vertex Degrees in Planar Graphs. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
63Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. Search on Bibsonomy J. ACM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF (k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph
63Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
63Sergio Cabello, Bojan Mohar Adding one edge to planar graphs makes crossing number hard. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2010 DBLP  DOI  BibTeX  RDF NP-hard, graph drawing, planar graphs, graph embedding, crossing number, topological graph theory
63Zhi-Zhong Chen, Mitsuharu Kouno A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
61Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
61Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd Edge-disjoint paths in Planar graphs with constant congestion. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Planar graphs, multicommodity flow, edge-disjoint paths
60Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann Matched Drawings of Planar Graphs. Search on Bibsonomy Graph Drawing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
60Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach Spanners in Sparse Graphs. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
60Van Bang Le, Raffaele Mosca, Haiko Müller On Stable Cutsets in Claw-Free Graphs and Planar Graphs. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
60Fabrizio Frati On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
59Zvi Galil, Giuseppe F. Italiano, Neil Sarnak Fully Dynamic Planarity Testing with Applications. Search on Bibsonomy J. ACM The full citation details ... 1999 DBLP  DOI  BibTeX  RDF planarity testing, planar graphs, dynamic graph algorithms
58Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd Edge-Disjoint Paths in Planar Graphs. Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
57Marcin Mucha, Piotr Sankowski Maximum Matchings in Planar Graphs via Gaussian Elimination. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Planar graphs, Maximum matching, Fast matrix multiplication
57Wen-Lian Hsu The coloring and maximum independent set problems on planar perfect graphs. Search on Bibsonomy J. ACM The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
55Laurent Flindt Muller, Martin Zachariasen Fast and Compact Oracles for Approximate Distances in Planar Graphs. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
55Danny Z. Chen, Xiaodong Wu Efficient Algorithms for k-Terminal Cuts on Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
54Herman J. Haverkort, Laura Toma I/O-Efficient Algorithms on Near-Planar Graphs. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
54Maria I. Andreou, Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations. Search on Bibsonomy MFCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
54Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
53Konstantinos Panagiotou, Angelika Steger Maximal biconnected subgraphs of random planar graphs. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  BibTeX  RDF
53Ashkan Aazami, Michael D. Stilp Approximation Algorithms and Hardness for Domination with Propagation. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Power Dominating Set, Approximation Algorithms, Integer Programming, Planar Graphs, Greedy Algorithms, Dominating Set, Hardness of Approximation, PTAS
52Andreas Jakoby, Till Tantau Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs
51William T. Trotter (eds.) Planar Graphs, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 18-21, 1991 Search on Bibsonomy Planar Graphs The full citation details ... 1993 DBLP  BibTeX  RDF
51 List of Participants. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
51C. Paul Bonnington, Charles H. C. Little A Generalisation of MacLane's Theorem to 3-graphs. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
51 Preface. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
51János Pach, Jenö Töröcsik Layout of Rooted Trees. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
51Michael D. Hutton, Anna Lubiw Upward Planar Drawing of Single Source Acyclic Digraphs. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
51Bojan Mohar, Neil Robertson Disjoint Essential Circuits in Toroidal Maps. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
51 Forword. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
51Daniel J. Kleitman Partitioning a Rectangle into Many Sub-rectangles so that a Line can Meet only a Few. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
51Hal A. Kierstead, William T. Trotter Planar Graph Coloring with an Uncooperative Partner. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
51Edward A. Bender, E. Rodney Canfield Enumeration of Degree Restricted Rooted Maps on the Sphere. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  BibTeX  RDF
51Sabeel Ansari, Lata Narayanan, Jaroslav Opatrny A Generalization of the Face Routing Algorithm to a Class of Non-Planar Networks. Search on Bibsonomy MobiQuitous The full citation details ... 2005 DBLP  DOI  BibTeX  RDF crossing edges, ad hoc networks, Wireless networks, MANET, routing algorithms, planar graphs, geometric graphs, position-based routing
51J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz 0001 Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
51Daniel A. Spielman, Shang-Hua Teng Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. Search on Bibsonomy FOCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF bounded-degree planar graphs, planar graphs, finite element analysis, numerical algorithms, spectral partitioning, finite element meshes
51Philip N. Klein, Sairam Subramanian A linear-processor polylog-time algorithm for shortest paths in planar graphs Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF linear-processor polylog-time algorithm, directed planar graphs, bounded-genus graphs, 2-dimensional overlap graphs, shortest paths, planar graphs, separators, decomposition tree
51Goos Kant Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF visibility representations, lmc-ordering, required area, minimum angle, number of bends, planar drawings, triconnected planar graphs, planar graphs, faces, vertices
51Martin Fürer Contracting Planar Graphs Efficiency in Parallel. Search on Bibsonomy FSTTCS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF Additional Keywords and Phrases Planar graphs, Fáry embeddings, Parallel algorithms
50MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami Plane embeddings of planar graph metrics. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2006 DBLP  DOI  BibTeX  RDF planar graphs, metric embedding, Euclidean plane
50Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. Search on Bibsonomy ICALP (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
50Marjan Marzban, Qian-Ping Gu, Xiaohua Jia Computational Study on Dominating Set Problem of Planar Graphs. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF PLANAR DOMINATING SET, computational study, data reduction, fixed-parameter algorithms, branch-decomposition
49Martin Fürer, Shiva Prasad Kasiviswanathan Approximately Counting Embeddings into Random Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
49Carlo Gaibisso, Guido Proietti, Richard B. Tan Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs. Search on Bibsonomy COCOON The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Transient Node Failures, Radio Networks Survivability, Planar Graphs, Minimum Spanning Tree
48Petr Hlinený, Gelasio Salazar On the Crossing Number of Almost Planar Graphs. Search on Bibsonomy Graph Drawing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF crossing-critical graphs, planarization, crossing number, crossing minimization
48Yusuke Kobayashi 0001, Ken-ichi Kawarabayashi Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  BibTeX  RDF
48Cyril Gavoille, Arnaud Labourel Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
48J. Joseph Fowler, Stephen G. Kobourov Characterization of Unlabeled Level Planar Graphs. Search on Bibsonomy Graph Drawing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
48Paul S. Bonsma The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes. Search on Bibsonomy WG The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
47Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. Search on Bibsonomy ICALP (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
47Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen lambda-Coloring of Graphs. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
47Éric Fusy, Gilles Schaeffer, Dominique Poulalhon Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Bijection, coding, counting, random generation
46Sadish Sadasivam, Huaming Zhang On Representation of Planar Graphs by Segments. Search on Bibsonomy AAIM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
46Manuel Bodirsky, Clemens Gröpl, Mihyun Kang Sampling Unlabeled Biconnected Planar Graphs. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
46Xuemin Lin, Peter Eades Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. Search on Bibsonomy COCOON The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Hierarchically Planar Graph, Visibility Representation, Drawing Area, Graph Drawing
46Sándor P. Fekete, Jana Kremer Tree Spanners in Planar Graphs. Search on Bibsonomy WG The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
46Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz Distance labeling in graphs. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF
45Bruno Courcelle Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas. Search on Bibsonomy RTA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
45Nicolas Nisse, Karol Suchan Fast Robber in Planar Graphs. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Cops and robber, grid, planar graph, subdivision, minor
45Tobias Storch How randomized search heuristics find maximum cliques in planar graphs. Search on Bibsonomy GECCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
44Maria I. Andreou, Sotiris E. Nikoletseas, Paul G. Spirakis Algorithms and Experiments on Colouring Squares of Planar Graphs. Search on Bibsonomy WEA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
44Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies. Search on Bibsonomy WG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
44Maciej M. Syslo On Some Generalizations of Outerplanar Graphs: Results and Open Problems. Search on Bibsonomy WG The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
44Leszek Gasieniec, David Peleg, Qin Xin 0001 Faster communication in known topology radio networks. Search on Bibsonomy PODC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF algorithms, broadcasting, planar graphs, gossiping, radio networks
44Piotr Indyk, Anastasios Sidiropoulos Probabilistic embeddings of bounded genus graphs into planar graphs. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2007 DBLP  DOI  BibTeX  RDF bounded genus graphs, probabilistic approximation, embeddings, planar graphs
43André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
43Bruno Courcelle, Denis Lapoire Facial Circuits of Planar Graphs and Context-Free Languages. Search on Bibsonomy MFCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
43Raphael Yuster, Uri Zwick Maximum matching in graphs with an excluded minor. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
42Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. Search on Bibsonomy Graph Drawing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
42Fabrizio Frati, Maurizio Patrignani A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. Search on Bibsonomy Graph Drawing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
42Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Train Tracks and Confluent Drawings. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
42Ken-ichi Kawarabayashi, Bojan Mohar Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Hadwiger conjecture, odd-minor, graph coloring, graph minor, list coloring
42Daniel Kobler, Udi Rotics Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Induced matching, Bull, Polynomial algorithms, Regular graphs, Line-graphs, Claw-free graphs
42Bruno Escoffier, Laurent Gourvès, Jérôme Monnot Complexity and Approximation Results for the Connected Vertex Cover Problem. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Connected vertex cover, APX-complete, approximation algorithm, planar graphs, bipartite graphs, chordal graphs
42Ajit A. Diwan, N. Usharani A Condition for the Three Colourability of Planar Locally Path Graphs. Search on Bibsonomy FSTTCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
42C. E. Veni Madhavan Approximation Algorithm for Maximum Independent Set in Planar Tiangle-Free Graphs. Search on Bibsonomy FSTTCS The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
41Carsten Gutwenger, Petra Mutzel Graph Embedding with Minimum Depth and Maximum External Face. Search on Bibsonomy Graph Drawing The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
41Robert Franke, Ignaz Rutter, Dorothea Wagner Computing Large Matchings in Planar Graphs with Fixed Minimum Degree. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
41Richard Cole 0001, Lukasz Kowalik New Linear-Time Algorithms for Edge-Coloring Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Algorithm, Planar graph, Edge-coloring, Linear-time
41Glencora Borradaile, Philip N. Klein The Two-Edge Connectivity Survivable Network Problem in Planar Graphs. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 2460 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license