|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 118 occurrences of 101 keywords
|
|
|
Results
Found 584 publication records. Showing 584 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
93 | John M. Boyer |
Additional PC-Tree Planarity Conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers, pp. 82-88, 2004, Springer, 3-540-24528-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers, pp. 220-235, 2002, Springer, 3-540-00158-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
81 | Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia |
Optimal Upward Planarity Testing of Single-Source Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings, pp. 37-48, 1993, Springer, 3-540-57273-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
78 | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo |
Quasi-Upward Planarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(3), pp. 474-506, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings, pp. 199-208, 2005, Springer, 3-540-24302-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
68 | Hubert Y. Chan 0002 |
A Parameterized Algorithm for Upward Planarity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 157-168, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
68 | Michael Forster, Christian Bachmaier |
Clustered Level Planarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2004: Theory and Practice of Computer Science, 30th Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 24-30, 2004, pp. 218-228, 2004, Springer, 3-540-20779-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
68 | Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster |
Radial Level Planarity Testing and Embedding in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers, pp. 393-405, 2003, Springer, 3-540-20831-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
68 | Michael Jünger, Sebastian Leipert, Petra Mutzel |
Level Planarity Testing in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 6th International Symposium, GD'98, Montréal, Canada, August 1998, Proceedings, pp. 224-237, 1998, Springer, 3-540-65473-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
66 | Zvi Galil, Giuseppe F. Italiano, Neil Sarnak |
Fully Dynamic Planarity Testing with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 46(1), pp. 28-91, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 22(3), pp. 351-362, 1998. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings, pp. 115-126, 2007, Springer, 978-3-540-74509-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
55 | Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun |
C-Planarity of Extrovert Clustered Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, pp. 211-222, 2005, Springer, 3-540-31425-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
55 | Walter Didimo, Francesco Giordano, Giuseppe Liotta |
Upward Spirality and Upward Planarity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, pp. 117-128, 2005, Springer, 3-540-31425-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
55 | Eric Allender, Meena Mahajan |
The Complexity of Planarity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 87-98, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
55 | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov |
Planarity-Preserving Clustering and Embedding for Large Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings, pp. 186-196, 1999, Springer, 3-540-66904-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
55 | Qing-Wen Feng, Robert F. Cohen, Peter Eades |
Planarity for Clustered Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings, pp. 213-226, 1995, Springer, 3-540-60313-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
55 | Jeffery R. Westbrook |
Fast Incremental Planarity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 19th International Colloquium, ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings, pp. 342-353, 1992, Springer, 3-540-55719-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
53 | Christoph Buchheim, Seok-Hee Hong 0001 |
Testing Planarity of Geometric Automorphisms in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(4), pp. 448-465, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 15(4), pp. 53:1-53:25, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
43 | Sarmad Abbasi, Patrick Healy, Aimal Rextin |
An Improved Upward Planarity Testing Algorithm and Related Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings, pp. 334-344, 2009, Springer, 978-3-642-00201-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Walter Didimo, Francesco Giordano, Giuseppe Liotta |
Overlapping cluster planarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APVIS ![In: APVIS 2007, 6th International Asia-Pacific Symposium on Visualization 2007, Sydney, Australia, 5-7 February 2007, pp. 73-80, 2007, IEEE Computer Society, 1-4244-0808-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Giuseppe Di Battista, Fabrizio Frati |
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 291-302, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina |
Lempel, Even, and Cederbaum Planarity Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings, pp. 129-144, 2004, Springer, 3-540-22067-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
43 | Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner |
Planarity of the 2-Level Cactus Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings, pp. 91-102, 2001, Springer, 3-540-42707-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
43 | Günter Hotz, Steffen Lohse |
Planarity Testing of Graphs on Base of a Spring Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers, pp. 471-472, 2001, Springer, 3-540-43309-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
43 | Giuseppe Di Battista, Giuseppe Liotta |
Upward Planarity Checking: "Faces Are More than Polygons". ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 6th International Symposium, GD'98, Montréal, Canada, August 1998, Proceedings, pp. 72-86, 1998, Springer, 3-540-65473-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
40 | Ken-ichi Kawarabayashi |
Planarity Allowing Few Error Vertices in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 639-648, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Few errors, Approximation Algorithms, TSP, Planarity, linear time |
40 | Pier Francesco Cortese, Giuseppe Di Battista |
Clustered planarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 32-34, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
cluster, graph drawing, planarity |
40 | Vijaya Ramachandran, John H. Reif |
An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 282-287, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
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) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 436-441, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISVC (1) ![In: Advances in Visual Computing, 4th International Symposium, ISVC 2008, Las Vegas, NV, USA, December 1-3, 2008. Proceedings, Part I, pp. 836-845, 2008, Springer, 978-3-540-89638-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
38 | Wen-Lian Hsu |
A Linear Time Algorithm For Finding Maximal Planar Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings, pp. 352-361, 1995, Springer, 3-540-60573-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
38 | Giuseppe Di Battista, Roberto Tamassia, Luca Vismara |
On-Line Convex Plabarity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings, pp. 242-255, 1994, Springer, 3-540-59071-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
36 | Youngmin Kim, Dusan Petranovic, Dennis Sylvester |
Simple and Accurate Models for Capacitance Increment due to Metal Fill Insertion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 12th Conference on Asia South Pacific Design Automation, ASP-DAC 2007, Yokohama, Japan, January 23-26, 2007, pp. 456-461, 2007, IEEE Computer Society, 1-4244-0629-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 11th International Conference, DGCI 2003, Naples, Italy, November 19-21, 2003, Proceedings, pp. 72-81, 2003, Springer, 3-540-20499-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 19(4), pp. 34:1-34:23, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
34 | Simon D. Fink, Ignaz Rutter |
Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.20632, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 896, pp. 19-30, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
34 | Thomas Bläsius, Simon D. Fink, Ignaz Rutter |
Synchronized Planarity with Applications to Constrained Planarity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 19:1-19:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 804, pp. 161-170, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
34 | Thomas Bläsius, Simon D. Fink, Ignaz Rutter |
Synchronized Planarity with Applications to Constrained Planarity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.15362, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings, pp. 148-159, 2019, Springer, 978-3-030-10563-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
34 | Pier Francesco Cortese, Maurizio Patrignani |
Clustered Planarity = Flat Clustered Planarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1808.07437, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1806.11413, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
34 | Pier Francesco Cortese, Maurizio Patrignani |
Clustered Planarity = Flat Clustered Planarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings, pp. 23-38, 2018, Springer, 978-3-030-04413-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
34 | Boris Klemz, Günter Rote |
Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1708.07428, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
34 | Boris Klemz, Günter Rote |
Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected Papers, pp. 440-453, 2017, Springer, 978-3-319-73914-4. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 571, pp. 1-9, 2015. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1406.6533, 2014. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014, Revised Selected Papers, pp. 246-258, 2014, Springer, 978-3-662-45802-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
34 | Marcus Schaefer 0001 |
Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 17(4), pp. 367-440, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
34 | Marcus Schaefer 0001 |
Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing - 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers, pp. 162-173, 2012, Springer, 978-3-642-36762-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011, pp. 107-116, 2011, ACM, 978-1-4503-0682-9. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
30 | Peter Eades |
Some Constrained Notions of Planarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 2, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Christian Bachmaier, Wolfgang Brunner |
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings, pp. 136-147, 2008, Springer, 978-3-540-87743-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISVC (1) ![In: Advances in Visual Computing, 4th International Symposium, ISVC 2008, Las Vegas, NV, USA, December 1-3, 2008. Proceedings, Part I, pp. 925-934, 2008, Springer, 978-3-540-89638-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Vladimir P. Korzhik, Bojan Mohar |
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers, pp. 302-312, 2008, Springer, 978-3-642-00218-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers, pp. 121-132, 2008, Springer, 978-3-642-00218-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers, pp. 102-113, 2008, Springer, 978-3-642-00218-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Aimal Rextin, Patrick Healy |
A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers, pp. 254-265, 2008, Springer, 978-3-642-00218-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Martin Harrigan, Patrick Healy |
Practical Level Planarity Testing and Layout with Embedding Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 62-68, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 303-314, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Christian Zschalig |
Planarity of Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFCA ![In: Formal Concept Analysis, Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings, pp. 391-402, 2005, Springer, 3-540-24525-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers, pp. 25-36, 2003, Springer, 3-540-20831-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | János Pach, Rados Radoicic, Géza Tóth 0001 |
Relaxing Planarity for Topological Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers, pp. 221-232, 2002, Springer, 3-540-20776-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Robin Thomas 0001 |
Graph Planarity and Related Topics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings, pp. 137-144, 1999, Springer, 3-540-66904-3. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings, pp. 212-223, 1993, Springer, 3-540-57273-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
30 | Thomas Lengauer |
Hierarchical planarity testing algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 36(3), pp. 474-509, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
30 | P. Sreenivasa Kumar, C. E. Veni Madhavan |
A New Class of Separators and Planarity of Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Ninth Conference, Bangalore, India, December 19-21, 1989, Proceedings, pp. 30-43, 1989, Springer, 3-540-52048-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
30 | Giuseppe Di Battista, Enrico Nardelli |
An Algorithm for Testing Planarity of Hierarchical Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graphtheoretic Concepts in Computer Science, International Workshop, WG '86, Bernried, Germany, June 17-19, 1986, Proceedings, pp. 277-289, 1986, Springer, 3-540-17218-1. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
30 | Joseph F. JáJá, Janos Simon |
Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1980 (MFCS'80), Proceedings of the 9th Symposium, Rydzyna, Poland, September 1-5, 1980, pp. 305-319, 1980, Springer, 3-540-10027-X. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
30 | Narsingh Deo |
Note on Hopcroft and Tarjan's Planarity Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 23(1), pp. 74-75, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
25 | Haim Kaplan, Yahav Nussbaum |
Maximum Flow in Directed Planar Graphs with Vertex Capacities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 397-407, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein 0001, Petra Mutzel |
Computing Maximum C-Planar Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers, pp. 114-120, 2008, Springer, 978-3-642-00218-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: IEEE 11th International Conference on Computer Vision, ICCV 2007, Rio de Janeiro, Brazil, October 14-20, 2007, pp. 1-8, 2007, IEEE Computer Society, 978-1-4244-1630-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Markus Chimani, Petra Mutzel, Jens M. Schmidt |
Efficient Extraction of Multiple Kuratowski Subdivisions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 159-170, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Anna Lubiw, Mark Petrick, Michael J. Spriggs |
Morphing orthogonal planar graph drawings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 222-230, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Nutan Limaye, Meena Mahajan, Jayalal Sarma |
Evaluating Monotone Circuits on Cylinders, Planes and Tori. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 660-671, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Herman J. Haverkort, Laura Toma |
I/O-Efficient Algorithms on Near-Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 580-591, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Carsten Gutwenger, Markus Chimani |
Non-planar Core Reduction of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, pp. 223-234, 2005, Springer, 3-540-31425-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Wen-Lian Hsu |
A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 787-797, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia |
Clustering Cycles into Cycles of Clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers, pp. 100-110, 2004, Springer, 3-540-24528-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou |
Map graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 49(2), pp. 127-138, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
maps, topological inference, Map graphs |
25 | Wen-Lian Hsu |
PC-Trees vs. PQ-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings, pp. 207-217, 2001, Springer, 3-540-42494-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Mehmet Aktuna, Rob A. Rutenbar, L. Richard Carley |
Device-level early floorplanning algorithms for RF circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(4), pp. 375-388, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
25 | Michael Jünger, Sebastian Leipert |
Level Planar Embedding in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings, pp. 72-81, 1999, Springer, 3-540-66904-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
25 | Patrick Healy, Ago Kuusik |
The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings, pp. 205-216, 1999, Springer, 3-540-66904-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
25 | Mehmet Aktuna, Rob A. Rutenbar, L. Richard Carley |
Device-level early floorplanning algorithms for RF circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 1998 International Symposium on Physical Design, ISPD 1998, Monterey, CA, USA, April 6-8, 1998, pp. 57-64, 1998, ACM, 1-58113-021-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 44(2), pp. 143-159, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VRCAI ![In: Proceedings of the 8th International Conference on Virtual Reality Continuum and its Applications in Industry, VRCAI 2009, Yokohama, Japan, December 14-15, 2009, pp. 127-132, 2009, ACM, 978-1-60558-912-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 92-99, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 96-105, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 300-305, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 183, pp. 106400, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
17 | Weichan Liu, Guiying Yan |
Weak-Dynamic Coloring of Graphs Beyond-Planarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 40(1), pp. 7, February 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.13702, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
17 | Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Marie Diana Sieper |
Clustered Planarity Variants for Level Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.13153, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
17 | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer 0001 |
Hanani-Tutte for Radial Planarity II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 30(1), 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Azzurra Ciliberti, Luca Moci |
On Chromatic Symmetric Homology and Planarity of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 30(1), 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 584 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ >>] |
|