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

• 2024
• 
  Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter:
  Accelerating Matroid Optimization through Fast Imprecise Oracles. CoRR abs/2402.02774 (2024)
• 
  Mohit Garg, Felix Hommelsheim, Alexander Lindermayr:
  Two-Edge Connectivity via Pac-Man Gluing. CoRR abs/2408.05282 (2024)
• 
  Franziska Eberle, Felix Hommelsheim, Malin Rau, Stefan Walzer:
  A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing. CoRR abs/2408.08627 (2024)
• 2023
• 
  Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
  Feedback vertex set reconfiguration in planar graphs. Theor. Comput. Sci. 979: 114188 (2023)
• 
  Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
  Fixed-parameter algorithms for graph constraint logic. Theor. Comput. Sci. 959: 113863 (2023)
• 
  Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior:
  Improved Approximation Algorithms for the Expanding Search Problem. ESA 2023: 54:1-54:15
• 
  Mohit Garg, Felix Hommelsheim, Nicole Megow:
  Matching Augmentation via Simultaneous Contractions. ICALP 2023: 65:1-65:17
• 
  Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior:
  Improved Approximation Algorithms for the Expanding Search Problem. CoRR abs/2301.03638 (2023)
• 
  Felix Hommelsheim, Nicole Megow, Komal Muluk, Britta Peis:
  Recoverable Robust Optimization with Commitment. CoRR abs/2306.08546 (2023)
• 2022
• 
  David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler:
  Flexible Graph Connectivity. Math. Program. 192(1): 409-441 (2022)
• 
  Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
  On the complexity of the bilevel minimum spanning tree problem. Networks 80(3): 338-355 (2022)
• 
  David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
  Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. SWAT 2022: 5:1-5:19
• 
  Mohit Garg, Felix Hommelsheim, Nicole Megow:
  Matching Augmentation via Simultaneous Contractions. CoRR abs/2211.01912 (2022)
• 2021
• 
  Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
  On the complexity of robust bilevel optimization with uncertain follower's objective. Oper. Res. Lett. 49(5): 703-707 (2021)
• 
  Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
  How to Secure Matchings against Edge Failures. SIAM J. Discret. Math. 35(3): 2265-2292 (2021)
• 
  Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
  On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective. CoRR abs/2105.08378 (2021)
• 2020
• 
  David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler:
  Flexible Graph Connectivity. IPCO 2020: 13-26
• 
  Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
  Fixed-Parameter Algorithms for Graph Constraint Logic. IPEC 2020: 15:1-15:15
• 
  David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
  Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults. CoRR abs/2009.05382 (2020)
• 
  Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
  Fixed-Parameter Algorithms for Graph Constraint Logic. CoRR abs/2011.10385 (2020)
• 
  Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
  On the Complexity of the Bilevel Minimum Spanning Tree Problem. CoRR abs/2012.12770 (2020)
• 2019
• 
  Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
  How to Secure Matchings Against Edge Failures. STACS 2019: 38:1-38:16
• 
  David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler:
  Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity. CoRR abs/1910.13297 (2019)
• 2018
• 
  Viktor Bindewald, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
  How to Secure Matchings Against Edge Failures. CoRR abs/1805.01299 (2018)