Aichholzer, Oswin; Fabila-Monroy, Ruy; Kindermann, Philipp; Parada, Irene; Paul, Rosna; Perz, Daniel; Schnider, Patrick; Vogtenhuber, Birgit Perfect matchings with crossings. (English) Zbl 07823154 Algorithmica 86, No. 3, 697-716 (2024). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{O. Aichholzer} et al., Algorithmica 86, No. 3, 697--716 (2024; Zbl 07823154) Full Text: DOI OA License
Agrawal, Akanksha; Fernau, Henning; Kindermann, Philipp; Mann, Kevin; Souza, Uéverton S. Recognizing well-dominated graphs is coNP-complete. (English) Zbl 07749680 Inf. Process. Lett. 183, Article ID 106419, 6 p. (2024). MSC: 05C69 68R10 68Q25 05C85 PDFBibTeX XMLCite \textit{A. Agrawal} et al., Inf. Process. Lett. 183, Article ID 106419, 6 p. (2024; Zbl 07749680) Full Text: DOI arXiv
Kindermann, Philipp; Sauer, Jan; Wolff, Alexander The computational complexity of the ChordLink model. (English) Zbl 07781098 J. Graph Algorithms Appl. 27, No. 9, 759-767 (2023). MSC: 68R10 68U05 05C10 PDFBibTeX XMLCite \textit{P. Kindermann} et al., J. Graph Algorithms Appl. 27, No. 9, 759--767 (2023; Zbl 07781098) Full Text: DOI
Da Lozzo, Giordano (ed.); Kindermann, Philipp (ed.) Guest editors’ foreword: Special issue on parameterized and approximation algorithms in graph drawing. (English) Zbl 07740691 J. Graph Algorithms Appl. 27, No. 6, 405-408 (2023). MSC: 00B15 05-06 05C85 PDFBibTeX XMLCite \textit{G. Da Lozzo} (ed.) and \textit{P. Kindermann} (ed.), J. Graph Algorithms Appl. 27, No. 6, 405--408 (2023; Zbl 07740691) Full Text: DOI
Chimani, Markus; Kindermann, Philipp; Montecchiani, Fabrizio; Valtr, Pavel Crossing numbers of beyond-planar graphs. (English) Zbl 1485.68176 Theor. Comput. Sci. 898, 44-49 (2022). Reviewer: I. M. Erusalimskiy (Rostow-na-Donu) MSC: 68R10 05C10 PDFBibTeX XMLCite \textit{M. Chimani} et al., Theor. Comput. Sci. 898, 44--49 (2022; Zbl 1485.68176) Full Text: DOI arXiv
Kindermann, Philipp; Montecchiani, Fabrizio; Schlipf, Lena; Schulz, André Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles. (English) Zbl 1452.05179 J. Graph Algorithms Appl. 25, No. 1, 1-28 (2021). MSC: 05C85 05C10 PDFBibTeX XMLCite \textit{P. Kindermann} et al., J. Graph Algorithms Appl. 25, No. 1, 1--28 (2021; Zbl 1452.05179) Full Text: DOI
Chaplick, Steven; Kindermann, Philipp; Löffler, Andre; Thiele, Florian; Wolff, Alexander; Zaft, Alexander; Zink, Johannes Recognizing stick graphs with and without length constraints. (English) Zbl 1451.05223 J. Graph Algorithms Appl. 24, No. 4, 657-681 (2020). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{S. Chaplick} et al., J. Graph Algorithms Appl. 24, No. 4, 657--681 (2020; Zbl 1451.05223) Full Text: DOI
Kindermann, Philipp; Kobourov, Stephen; Löffler, Maarten; Nöllenburg, Martin; Schulz, André; Vogtenhuber, Birgit Lombardi drawings of knots and links. (English) Zbl 1464.68289 J. Comput. Geom. 10, No. 1, 444-476 (2019). MSC: 68R10 05C62 57K10 57M15 68U05 PDFBibTeX XMLCite \textit{P. Kindermann} et al., J. Comput. Geom. 10, No. 1, 444--476 (2019; Zbl 1464.68289) Full Text: DOI
Angelini, Patrizio; Bekos, Michael A.; Didimo, Walter; Grilli, Luca; Kindermann, Philipp; Mchedlidze, Tamara; Prutkin, Roman; Symvonis, Antonios; Tappini, Alessandra Greedy rectilinear drawings. (English) Zbl 1431.68087 Theor. Comput. Sci. 795, 375-397 (2019). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{P. Angelini} et al., Theor. Comput. Sci. 795, 375--397 (2019; Zbl 1431.68087) Full Text: DOI arXiv
Angelini, Patrizio; Da Lozzo, Giordano; Di Battista, Giuseppe; Di Donato, Valentino; Kindermann, Philipp; Rote, Günter; Rutter, Ignaz Windrose planarity: embedding graphs with direction-constrained edges. (English) Zbl 1454.68091 ACM Trans. Algorithms 14, No. 4, Article No. 54, 24 p. (2018). MSC: 68R10 05C10 68Q25 68U05 PDFBibTeX XMLCite \textit{P. Angelini} et al., ACM Trans. Algorithms 14, No. 4, Article No. 54, 24 p. (2018; Zbl 1454.68091) Full Text: DOI
Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Kindermann, Philipp; Schneck, Thomas 1-fan-bundle-planar drawings of graphs. (English) Zbl 1426.68193 Frati, Fabrizio (ed.) et al., Graph drawing and network visualization. 25th international symposium, GD 2017, Boston, MA, USA, September 25–27, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10692, 517-530 (2018). MSC: 68R10 05C62 PDFBibTeX XMLCite \textit{P. Angelini} et al., Lect. Notes Comput. Sci. 10692, 517--530 (2018; Zbl 1426.68193) Full Text: DOI arXiv
Kindermann, Philipp; Kobourov, Stephen; Löffler, Maarten; Nöllenburg, Martin; Schulz, André; Vogtenhuber, Birgit Lombardi drawings of knots and links. (English) Zbl 1464.68288 Frati, Fabrizio (ed.) et al., Graph drawing and network visualization. 25th international symposium, GD 2017, Boston, MA, USA, September 25–27, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10692, 113-126 (2018). MSC: 68R10 05C62 57K10 57M15 68U05 PDFBibTeX XMLCite \textit{P. Kindermann} et al., Lect. Notes Comput. Sci. 10692, 113--126 (2018; Zbl 1464.68288) Full Text: DOI arXiv
Kindermann, Philipp; Meulemans, Wouter; Schulz, André Experimental analysis of the accessibility of drawings with few segments. (English) Zbl 1398.05142 J. Graph Algorithms Appl. 22, No. 3, 501-518 (2018). MSC: 05C62 05C85 05C05 05C42 PDFBibTeX XMLCite \textit{P. Kindermann} et al., J. Graph Algorithms Appl. 22, No. 3, 501--518 (2018; Zbl 1398.05142) Full Text: DOI
Hültenschmidt, Gregor; Kindermann, Philipp; Meulemans, Wouter; Schulz, André Drawing planar graphs with few geometric primitives. (English) Zbl 1394.05081 J. Graph Algorithms Appl. 22, No. 2, 357-387 (2018). MSC: 05C62 05C10 05C85 PDFBibTeX XMLCite \textit{G. Hültenschmidt} et al., J. Graph Algorithms Appl. 22, No. 2, 357--387 (2018; Zbl 1394.05081) Full Text: DOI
Eppstein, David; Kindermann, Philipp; Kobourov, Stephen; Liotta, Giuseppe; Lubiw, Anna; Maignan, Aude; Mondal, Debajyoti; Vosoughpour, Hamideh; Whitesides, Sue; Wismath, Stephen On the planar split thickness of graphs. (English) Zbl 1390.68498 Algorithmica 80, No. 3, 977-994 (2018). MSC: 68R10 05C10 68Q17 68Q25 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Algorithmica 80, No. 3, 977--994 (2018; Zbl 1390.68498) Full Text: DOI arXiv
Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Kindermann, Philipp; Schneck, Thomas 1-fan-bundle-planar drawings of graphs. (English) Zbl 1392.68320 Theor. Comput. Sci. 723, 23-50 (2018). MSC: 68R10 05C62 PDFBibTeX XMLCite \textit{P. Angelini} et al., Theor. Comput. Sci. 723, 23--50 (2018; Zbl 1392.68320) Full Text: DOI arXiv
Hültenschmidt, Gregor; Kindermann, Philipp; Meulemans, Wouter; Schulz, André Drawing planar graphs with few geometric primitives. (English) Zbl 1483.05183 Bodlaender, Hans L. (ed.) et al., Graph-theoretic concepts in computer science. 43rd international workshop, WG 2017, Eindhoven, The Netherlands, June 21–23, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10520, 316-329 (2017). MSC: 05C85 05C10 05C62 68R10 PDFBibTeX XMLCite \textit{G. Hültenschmidt} et al., Lect. Notes Comput. Sci. 10520, 316--329 (2017; Zbl 1483.05183) Full Text: DOI arXiv
Angelini, Patrizio; Da Lozzo, Giordano; Di Battista, Giuseppe; Di Donato, Valentino; Kindermann, Philipp; Rote, Günter; Rutter, Ignaz Windrose planarity: embedding graphs with direction-constrained edges. (English) Zbl 1410.68274 Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 985-996 (2016). MSC: 68R10 05C10 68Q25 68U05 PDFBibTeX XMLCite \textit{P. Angelini} et al., in: Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10--12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 985--996 (2016; Zbl 1410.68274) Full Text: DOI arXiv
Angelini, Patrizio; Chaplick, Steven; Cornelsen, Sabine; Da Lozzo, Giordano; Di Battista, Giuseppe; Eades, Peter; Kindermann, Philipp; Kratochvíl, Jan; Lipp, Fabian; Rutter, Ignaz Simultaneous orthogonal planarity. (English) Zbl 1478.68211 Hu, Yifan (ed.) et al., Graph drawing and network visualization. 24th international symposium, GD 2016, Athens, Greece, September 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9801, 532-545 (2016). MSC: 68R10 05C10 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. Angelini} et al., Lect. Notes Comput. Sci. 9801, 532--545 (2016; Zbl 1478.68211) Full Text: DOI arXiv
Brandenburg, Franz J.; Didimo, Walter; Evans, William S.; Kindermann, Philipp; Liotta, Giuseppe; Montecchiani, Fabrizio Recognizing and drawing IC-planar graphs. (English) Zbl 1342.68251 Theor. Comput. Sci. 636, 1-16 (2016). MSC: 68R10 05C10 05C85 68Q17 PDFBibTeX XMLCite \textit{F. J. Brandenburg} et al., Theor. Comput. Sci. 636, 1--16 (2016; Zbl 1342.68251) Full Text: DOI arXiv
Eppstein, David; Kindermann, Philipp; Kobourov, Stephen; Liotta, Giuseppe; Lubiw, Anna; Maignan, Aude; Mondal, Debajyoti; Vosoughpour, Hamideh; Whitesides, Sue; Wismath, Stephen On the planar split thickness of graphs. (English) Zbl 1383.68060 Kranakis, Evangelos (ed.) et al., LATIN 2016: theoretical informatics. 12th Latin American symposium, Ensenada, Mexico, April 11–15, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-49528-5/pbk; 978-3-662-49529-2/ebook). Lecture Notes in Computer Science 9644, 403-415 (2016). MSC: 68R10 05C10 68Q17 68Q25 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Lect. Notes Comput. Sci. 9644, 403--415 (2016; Zbl 1383.68060) Full Text: DOI arXiv
Bekos, Michael A.; van Dijk, Thomas C.; Kindermann, Philipp; Wolff, Alexander Simultaneous drawing of planar graphs with right-angle crossings and few bends. (English) Zbl 1331.05157 J. Graph Algorithms Appl. 20, No. 1, 133-158 (2016). MSC: 05C62 05C10 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., J. Graph Algorithms Appl. 20, No. 1, 133--158 (2016; Zbl 1331.05157) Full Text: DOI arXiv
Brandenburg, Franz J.; Didimo, Walter; Evans, William S.; Kindermann, Philipp; Liotta, Giuseppe; Montecchiani, Fabrizio Recognizing and drawing IC-planar graphs. (English) Zbl 1471.68189 Di Giacomo, Emilio (ed.) et al., Graph drawing and network visualization. 23rd international symposium, GD 2015, Los Angeles, CA, USA, September 24–26, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9411, 295-308 (2015). MSC: 68R10 05C10 05C85 68Q25 PDFBibTeX XMLCite \textit{F. J. Brandenburg} et al., Lect. Notes Comput. Sci. 9411, 295--308 (2015; Zbl 1471.68189) Full Text: DOI arXiv
Kindermann, Philipp; Schulz, André; Spoerhase, Joachim; Wolff, Alexander On monotone drawings of trees. (English) Zbl 1405.68249 Duncan, Christian (ed.) et al., Graph drawing. 22nd international symposium, GD 2014, Würzburg, Germany, September 24–26, 2014. Revised selected papers. Berlin: Springer (ISBN 978-3-662-45802-0/pbk). Lecture Notes in Computer Science 8871, 488-500 (2014). MSC: 68R10 05C05 68U05 PDFBibTeX XMLCite \textit{P. Kindermann} et al., Lect. Notes Comput. Sci. 8871, 488--500 (2014; Zbl 1405.68249) Full Text: DOI arXiv
Alam, Muhammad Jawaherul; Bekos, Michael A.; Kaufmann, Michael; Kindermann, Philipp; Kobourov, Stephen G.; Wolff, Alexander Smooth orthogonal drawings of planar graphs. (English) Zbl 1405.68232 Pardo, Alberto (ed.) et al., LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 – April 4, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54422-4/pbk). Lecture Notes in Computer Science 8392, 144-155 (2014). MSC: 68R10 05C10 PDFBibTeX XMLCite \textit{M. J. Alam} et al., Lect. Notes Comput. Sci. 8392, 144--155 (2014; Zbl 1405.68232) Full Text: DOI arXiv