• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 120 matches

• 2024
• 
  Oswin Aichholzer, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber:
  Perfect Matchings with Crossings. Algorithmica 86(3): 697-716 (2024)
• 
  Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza:
  Recognizing well-dominated graphs is coNP-complete. Inf. Process. Lett. 183: 106419 (2024)
• 
  Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
  Geometric Thickness of Multigraphs is ∃ ℝ-Complete. LATIN (1) 2024: 336-349
• 
  Carolina Haase, Philipp Kindermann:
  On Layered Area-Proportional Rectangle Contact Representations. WALCOM 2024: 149-162
• 
  Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter:
  On k-Plane Insertion into Plane Drawings. CoRR abs/2402.14552 (2024)
• 2023
• 
  Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger:
  Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications 43(3): 24-35 (2023)
• 
  Philipp Kindermann, Jan Sauer, Alexander Wolff:
  The Computational Complexity of the ChordLink Model. J. Graph Algorithms Appl. 27(9): 759-767 (2023)
• 
  Giordano Da Lozzo, Philipp Kindermann:
  Guest Editors' Foreword. J. Graph Algorithms Appl. 27(6): 405-408 (2023)
• 
  Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta:
  Mutual Witness Proximity Drawings of Isomorphic Trees. GD (1) 2023: 304-319
• 
  Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov:
  Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. GD (2) 2023: 203-217
• 
  Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr:
  Three Edge-Disjoint Plane Spanning Paths in a Point Set. GD (1) 2023: 323-338
• 
  Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov:
  The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. ISAAC 2023: 46:1-46:13
• 
  Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi:
  Parameterized Approaches to Orthogonal Compaction. SOFSEM 2023: 111-125
• 
  Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink:
  The Complexity of Finding Tangles. SOFSEM 2023: 3-17
• 
  Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger:
  Splitting Vertices in 2-Layer Graph Drawings. CoRR abs/2301.10872 (2023)
• 
  Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr:
  Three Edge-disjoint Plane Spanning Paths in a Point Set. CoRR abs/2306.07237 (2023)
• 
  Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov:
  Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth. CoRR abs/2309.01264 (2023)
• 
  Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta:
  Mutual Witness Proximity Drawings of Isomorphic Trees. CoRR abs/2309.01463 (2023)
• 
  Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov:
  The st-Planar Edge Completion Problem is Fixed-Parameter Tractable. CoRR abs/2309.15454 (2023)
• 
  Carolina Haase, Philipp Kindermann:
  On Layered Area-Proportional Rectangle Contact Representations. CoRR abs/2311.15057 (2023)
• 
  Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
  Geometric Thickness of Multigraphs is ∃R-complete. CoRR abs/2312.05010 (2023)
• 
  Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink:
  Deciding the Feasibility and Minimizing the Height of Tangles. CoRR abs/2312.16213 (2023)
• 2022
• 
  William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
  Minimum rectilinear polygons for given angle sequences. Comput. Geom. 100: 101820 (2022)
• 
  Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze:
  On mixed linear layouts of series-parallel graphs. Theor. Comput. Sci. 936: 129-138 (2022)
• 
  Steven Chaplick, Stefan Felsner, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
  Simple algorithms for partial and simultaneous rectangular duals with given contact orientations. Theor. Comput. Sci. 919: 66-74 (2022)
• 
  Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr:
  Crossing numbers of beyond-planar graphs. Theor. Comput. Sci. 898: 44-49 (2022)
• 
  Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter:
  The Rique-Number of Graphs. GD 2022: 371-386
• 
  Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
  Morphing Rectangular Duals. GD 2022: 389-403
• 
  Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff:
  Outside-Obstacle Representations with All Vertices on the Outer Face. GD 2022: 432-440
• 
  Philipp Kindermann, Fabian Klute, Tamara Mchedlidze, Wouter Meulemans:
  Graph Drawing Contest Report. GD 2022: 459-470

skipping 90 more matches