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

• 2010
• 
  Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote:
  Acyclic Orientation of Drawings. J. Graph Algorithms Appl. 14(2): 367-384 (2010)
• 
  Muhammad Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi, Md. Saidur Rahman:
  Minimum-Layer Upward Drawings of Trees. J. Graph Algorithms Appl. 14(2): 245-267 (2010)
• 
  Patrizio Angelini, Fabrizio Frati, Luca Grilli:
  An Algorithm to Construct Greedy Drawings of Triangulations. J. Graph Algorithms Appl. 14(1): 19-51 (2010)
• 
  Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
  On Metro-Line Crossing Minimization. J. Graph Algorithms Appl. 14(1): 75-96 (2010)
• 
  Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle:
  Finding the Most Relevant Fragments in Networks. J. Graph Algorithms Appl. 14(2): 307-336 (2010)
• 
  Sean Cleary, Katherine St. John:
  A Linear-Time Approximation Algorithm for Rotation Distance. J. Graph Algorithms Appl. 14(2): 385-390 (2010)
• 
  Cornelia Dangelmayr, Stefan Felsner, William T. Trotter:
  Intersection Graphs of Pseudosegments: Chordal Graphs. J. Graph Algorithms Appl. 14(2): 199-220 (2010)
• 
  Shantanu Das, Beat Gfeller, Peter Widmayer:
  Computing All Best Swaps for Minimum-Stretch Tree Spanners. J. Graph Algorithms Appl. 14(2): 287-306 (2010)
• 
  Emden R. Gansner, Yifan Hu:
  Efficient, Proximity-Preserving Node Overlap Removal. J. Graph Algorithms Appl. 14(1): 53-74 (2010)
• 
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino:
  Visual Analysis of One-To-Many Matched Graphs. J. Graph Algorithms Appl. 14(1): 97-119 (2010)
• 
  Robert Görke, Marco Gaertler, Florian Hübner, Dorothea Wagner:
  Computational Aspects of Lucidity-Driven Graph Clustering. J. Graph Algorithms Appl. 14(2): 165-197 (2010)
• 
  Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
  Cubic graphs have bounded slope parameter. J. Graph Algorithms Appl. 14(1): 5-17 (2010)
• 
  Sebastian Kluge, Martin Brokate, Konrad Reif:
  New complexity results for time-constrained dynamical optimal path problems. J. Graph Algorithms Appl. 14(2): 123-147 (2010)
• 
  Vadim V. Lozin, Martin Milanic:
  On the Maximum Independent Set Problem in Subclasses of Planar Graphs. J. Graph Algorithms Appl. 14(2): 269-286 (2010)
• 
  Charalampos Papamanthou, Ioannis G. Tollis:
  Applications of Parameterized st-Orientations. J. Graph Algorithms Appl. 14(2): 337-365 (2010)
• 
  Akiyoshi Shioura, Mutsunori Yagiura:
  A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. J. Graph Algorithms Appl. 14(2): 391-407 (2010)
• 
  Nándor Sieben:
  A Graph Pebbling Algorithm on Weighted Graphs. J. Graph Algorithms Appl. 14(2): 221-244 (2010)
• 
  Ioannis G. Tollis, Maurizio Patrignani:
  Guest Editor's Foreword. J. Graph Algorithms Appl. 14(1): 3-4 (2010)
• 
  D. Jacob Wildstrom:
  Resource relocation on asymmetric networks. J. Graph Algorithms Appl. 14(2): 149-163 (2010)