• 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 257 matches

• 2024
• 
  Guido Brückner, Ignaz Rutter, Peter Stumpf:
  Extending Partial Representations of Circle Graphs in Near-Linear Time. Algorithmica 86(7): 2152-2173 (2024)
• 
  Miriam Münch, Ignaz Rutter, Peter Stumpf:
  Partial and Simultaneous Transitive Orientations via Modular Decompositions. Algorithmica 86(4): 1263-1292 (2024)
• 
  Simon D. Fink, Ignaz Rutter:
  Constrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm. ALENEX 2024: 1-14
• 
  Jakob Baumann, Ignaz Rutter, Dirk Sudholt:
  Evolutionary Computation Meets Graph Drawing: Runtime Analysis for Crossing Minimisation on Layered Graph Drawings. GECCO 2024
• 
  Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Marie Diana Sieper:
  Clustered Planarity Variants for Level Graphs. CoRR abs/2402.13153 (2024)
• 
  Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter:
  On k-Plane Insertion into Plane Drawings. CoRR abs/2402.14552 (2024)
• 2023
• 
  Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu:
  Untangling circular drawings: Algorithms and complexity. Comput. Geom. 111: 101975 (2023)
• 
  Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
  A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing. Discret. Comput. Geom. 70(4): 1292-1355 (2023)
• 
  Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter:
  Drawing Simultaneously Embedded Graphs with Few Bends. Int. J. Found. Comput. Sci. 34(7): 807-824 (2023)
• 
  Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
  Parameterized complexity of graph planarity with restricted cyclic orders. J. Comput. Syst. Sci. 135: 125-144 (2023)
• 
  Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
  Experimental Comparison of PC-Trees and PQ-Trees. ACM J. Exp. Algorithmics 28: 1.10:1-1.10:24 (2023)
• 
  Ignaz Rutter, Helen C. Purchase:
  Guest Editors' Foreword. J. Graph Algorithms Appl. 27(2): 45-47 (2023)
• 
  Thomas Bläsius, Simon D. Fink, Ignaz Rutter:
  Synchronized Planarity with Applications to Constrained Planarity Problems. ACM Trans. Algorithms 19(4): 34:1-34:23 (2023)
• 
  Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms:
  The Influence of Dimensions on the Complexity of Computing Decision Trees. AAAI 2023: 8343-8350
• 
  Simon D. Fink, Ignaz Rutter:
  Maintaining Triconnected Components Under Node Expansion. CIAC 2023: 202-216
• 
  Ignaz Rutter, Peter Stumpf:
  Simultaneous Representation of Interval Graphs in the Sunflower Case. ESA 2023: 90:1-90:15
• 
  Patricia Bachmann, Ignaz Rutter, Peter Stumpf:
  On 3-Coloring Circle Graphs. GD (1) 2023: 152-160
• 
  Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
  Parameterized Complexity of Simultaneous Planarity. GD (2) 2023: 82-96
• 
  Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter:
  Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1. WG 2023: 30-43
• 
  Simon D. Fink, Ignaz Rutter:
  Maintaining Triconnected Components under Node Expansion. CoRR abs/2301.03972 (2023)
• 
  Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter:
  Parameterized Complexity of Vertex Splitting to Pathwidth at most 1. CoRR abs/2302.14725 (2023)
• 
  Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
  Parameterized Complexity of Simultaneous Planarity. CoRR abs/2308.11401 (2023)
• 
  Patricia Bachmann, Ignaz Rutter, Peter Stumpf:
  On 3-Coloring Circle Graphs. CoRR abs/2309.02258 (2023)
• 
  Simon D. Fink, Ignaz Rutter:
  Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm. CoRR abs/2310.20632 (2023)
• 2022
• 
  Guido Brückner, Ignaz Rutter, Peter Stumpf:
  Level-Planarity: Transitivity vs. Even Crossings. Electron. J. Comb. 29(4) (2022)
• 
  Marcel Radermacher, Ignaz Rutter:
  Inserting an edge into a geometric embedding. Comput. Geom. 102: 101843 (2022)
• 
  Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
  On Turn-Regular Orthogonal Representations. J. Graph Algorithms Appl. 26(3): 285-306 (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)
• 
  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

skipping 227 more matches