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

• 2024
• 
  Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
  Adjacency Graphs of Polyhedral Surfaces. Discret. Comput. Geom. 71(4): 1429-1455 (2024)
• 
  Aaron T. Becker, Sándor P. Fekete, Li Huang, Phillip Keldenich, Linda Kleist, Dominik Krupke, Christian Rieck, Arne Schmidt:
  Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces. CoRR abs/2408.09729 (2024)
• 
  Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth:
  Minimum Plane Bichromatic Spanning Trees. CoRR abs/2409.11614 (2024)
• 2023
• 
  Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist:
  Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game. Ann. Oper. Res. 321(1): 79-101 (2023)
• 
  Eva Stehr, Linda Kleist:
  Folding polyiamonds into octahedra. Comput. Geom. 108: 101917 (2023)
• 
  Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber:
  The Complexity of Recognizing Geometric Hypergraphs. GD (1) 2023: 163-179
• 
  Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber:
  The Complexity of Recognizing Geometric Hypergraphs. CoRR abs/2302.13597 (2023)
• 
  Henrik von Kleist, Alireza Zamanian, Ilya Shpitser, Narges Ahmidi:
  Evaluation of Active Feature Acquisition Methods for Time-varying Feature Settings. CoRR abs/2312.01530 (2023)
• 
  Henrik von Kleist, Alireza Zamanian, Ilya Shpitser, Narges Ahmidi:
  Evaluation of Active Feature Acquisition Methods for Static Feature Settings. CoRR abs/2312.03619 (2023)
• 2022
• 
  Kevin Buchin, Alexander Hill, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs:
  Minimum Scan Cover and Variants: Theory and Experiments. ACM J. Exp. Algorithmics 27: 4.5:1-4.5:28 (2022)
• 
  Charles Camacho, Silvia Fernández-Merchant, Marija Jelic Milutinovic, Rachel Kirsch, Linda Kleist, Elizabeth Bailey Matson, Jennifer White:
  Bounding the tripartite-circle crossing number of complete tripartite graphs. J. Graph Theory 100(1): 5-27 (2022)
• 
  Felix Peppert, Max von Kleist, Christof Schütte, Vikram Sunkara:
  On the Sufficient Condition for Solving the Gap-Filling Problem Using Deep Convolutional Neural Networks. IEEE Trans. Neural Networks Learn. Syst. 33(11): 6194-6205 (2022)
• 
  James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak:
  A Solution to Ringel's Circle Problem. SoCG 2022: 33:1-33:14
• 
  Moritz Buchem, Linda Kleist, Daniel Schmidt genannt Waldschmidt:
  Scheduling with Machine Conflicts. WAOA 2022: 36-60
• 
  Eva Stehr, Linda Kleist:
  Folding Polyiamonds into Octahedra. CoRR abs/2207.13989 (2022)
• 2021
• 
  Franziska Hufsky, Kevin Lamkiewicz, Alexandre Almeida, Abdel Aouacheria, Cecilia N. Arighi, Alex Bateman, Jan Baumbach, Niko Beerenwinkel, Christian Brandt, Marco Cacciabue, Sara Chuguransky, Oliver Drechsel, Robert D. Finn, Adrian Fritz, Stephan Fuchs, Georges Hattab, Anne-Christin Hauschild, Dominik Heider, Marie Hoffmann, Martin Hölzer, Stefan Hoops, Lars Kaderali, Ioanna Kalvari, Max von Kleist, Renó Kmiecinski, Denise Kühnert, Gorka Lasso, Pieter Libin, Markus List, Hannah F. Löchel, Maria Jesus Martin, Roman Martin, Julian O. Matschinske, Alice C. McHardy, Pedro Mendes, Jaina Mistry, Vincent Navratil, Eric P. Nawrocki, Áine Niamh O'toole, Nancy Ontiveros-Palacios, Anton I. Petrov, Guillermo Rangel-Pineros, Nicole Redaschi, Susanne Reimering, Knut Reinert, Alejandro Reyes, Lorna J. Richardson, David L. Robertson, Sepideh Sadegh, Joshua B. Singer, Kristof Theys, Chris Upton, Marius Welzel, Lowri Williams, Manja Marz:
  Computational strategies to combat COVID-19: useful tools to accelerate SARS-CoV-2 and coronavirus research. Briefings Bioinform. 22(2): 642-663 (2021)
• 
  Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt:
  Folding polyominoes with holes into a cube. Comput. Geom. 93: 101700 (2021)
• 
  William S. Evans, Stefan Felsner, Linda Kleist, Stephen G. Kobourov:
  On Area-Universal Quadrangulations. J. Graph Algorithms Appl. 25(1): 171-193 (2021)
• 
  Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
  Worst-Case Optimal Squares Packing into Disks. J. Comput. Geom. 12(2): 149-175 (2021)
• 
  Nomenjanahary Alexia Raharinirina, Felix Peppert, Max von Kleist, Christof Schütte, Vikram Sunkara:
  Inferring gene regulatory networks from single-cell RNA-seq temporal snapshot data requires higher-order moments. Patterns 2(9): 100332 (2021)
• 
  Sándor P. Fekete, Linda Kleist, Dominik Krupke:
  Minimum Scan Cover with Angular Transition Costs. SIAM J. Discret. Math. 35(2): 1337-1355 (2021)
• 
  Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
  Adjacency Graphs of Polyhedral Surfaces. SoCG 2021: 11:1-11:17
• 
  Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
  Packing Squares into a Disk with Optimal Worst-Case Density. SoCG 2021: 36:1-36:16
• 
  Tomasz Stanislawek, Filip Gralinski, Anna Wróblewska, Dawid Lipinski, Agnieszka Kaliska, Paulina Rosalska, Bartosz Topolski, Przemyslaw Biecek:
  Kleister: Key Information Extraction Datasets Involving Long Documents with Complex Layouts. ICDAR (1) 2021: 564-579
• 
  Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr:
  Upward Point Set Embeddings of Paths and Trees. WALCOM 2021: 234-246
• 
  Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist:
  Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game. WALCOM 2021: 103-115
• 
  Kevin Buchin, Sándor P. Fekete, Alexander Hill, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs:
  Minimum Scan Cover and Variants - Theory and Experiments. SEA 2021: 4:1-4:16
• 
  Moritz Buchem, Linda Kleist, Daniel Schmidt genannt Waldschmidt:
  Scheduling with Contact Restrictions - A Problem Arising in Pandemics. CoRR abs/2102.08231 (2021)
• 
  Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
  Packing Squares into a Disk with Optimal Worst-Case Density. CoRR abs/2103.07258 (2021)
• 
  Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
  Adjacency Graphs of Polyhedral Surfaces. CoRR abs/2103.09803 (2021)

skipping 38 more matches