• 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

• 2022
• 
  Patrik Schönfeldt, Adrian Grimm, Bhawana Neupane, Herena Torio, Pedro Duran, Peter Klement, Benedikt Hanke, Karsten von Maydell, Carsten Agert:
  Simultaneous optimization of temperature and energy in linear energy system models. OSMSES 2022: 1-6
• 2021
• 
  Katharina J. Rohlfing, Philipp Cimiano, Ingrid Scharlau, Tobias Matzner, Heike M. Buhl, Hendrik Buschmeier, Elena Esposito, Angela Grimminger, Barbara Hammer, Reinhold Häb-Umbach, Ilona Horwath, Eyke Hüllermeier, Friederike Kern, Stefan Kopp, Kirsten Thommes, Axel-Cyrille Ngonga Ngomo, Carsten Schulte, Henning Wachsmuth, Petra Wagner, Britta Wrede:
  Explanation as a Social Practice: Toward a Conceptual Framework for the Social Design of AI Systems. IEEE Trans. Cogn. Dev. Syst. 13(3): 717-728 (2021)
• 2020
• 
  Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
  Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. Comput. Geom. 89: 101631 (2020)
• 
  Patrik Schönfeldt, Adrian Grimm, Bhawana Neupane, Herena Torio, Pedro Duran, Peter Klement, Benedikt Hanke, Karsten von Maydell, Carsten Agert:
  Simultaneous optimisation of temperature and energy in linear energy system models. CoRR abs/2012.12664 (2020)
• 2017
• 
  Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid:
  Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut. WADS 2017: 301-312
• 2016
• 
  Carsten Sensler, Thomas Grimm:
  "Die fantastischen Fünf" - keine Angst vor der digitalen Transformation. Wirtschaftsinformatik Manag. 8(1): 45-53 (2016)
• 
  Therese Biedl, Carsten Grimm, Leonidas Palios, Jonathan Richard Shewchuk, Sander Verdonschot:
  Realizing Farthest-Point Voronoi Diagrams. CCCG 2016: 48-56
• 
  Ulrich Schwesinger, Mathias Bürki, Julian Timpner, Stephan Rottmann, Lars C. Wolf, Lina María Paz, Hugo Grimmett, Ingmar Posner, Paul Newman, Christian Häne, Lionel Heng, Gim Hee Lee, Torsten Sattler, Marc Pollefeys, Marco Allodi, Francesco Valenti, Keiji Mimura, Bernd Goebelsmann, Wojciech Derendarz, Peter Mühlfellner, Stefan Wonneberger, Rene Waldmann, Sebastian Grysczyk, Carsten Last, Stefan Bruning, Sven Horstmann, Marc Bartholomaus, Clemens Brummer, Martin Stellmacher, Fabian Pucks, Marcel Nicklas, Roland Siegwart:
  Automated valet parking and charging for e-mobility. Intelligent Vehicles Symposium 2016: 157-164
• 
  Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
  Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. SWAT 2016: 27:1-27:14
• 
  Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid:
  Minimizing the Continuous Diameter when Augmenting a Tree with a Shortcut. CoRR abs/1612.01370 (2016)
• 2015
• 
  Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
  Optimal Data Structures for Farthest-Point Queries in Cactus Networks. J. Graph Algorithms Appl. 19(1): 11-41 (2015)
• 
  Carsten Grimm:
  Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks. WG 2015: 122-137
• 
  Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
  Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. CoRR abs/1512.02257 (2015)
• 
  Carsten Grimm:
  Efficient Farthest-Point Queries in Two-Terminal Series-Parallel Networks. CoRR abs/1503.01706 (2015)
• 
  Carsten Grimm:
  A Lower Bound on Supporting Predecessor Search in k sorted Arrays. CoRR abs/1507.03823 (2015)
• 2014
• 
  Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid:
  A note on the unsolvability of the weighted region shortest path problem. Comput. Geom. 47(7): 724-727 (2014)
• 
  Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
  Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CoRR abs/1411.1879 (2014)
• 2013
• 
  Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
  Network Farthest-Point Diagrams. J. Comput. Geom. 4(1): 182-211 (2013)
• 
  Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
  Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CCCG 2013
• 
  Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
  Network Farthest-Point Diagrams. CoRR abs/1304.1909 (2013)
• 
  Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid:
  A Note on the Unsolvability of the Weighted Region Shortest Path Problem. CoRR abs/1305.5209 (2013)
• 2012
• 
  Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
  On Farthest-Point Information in Networks. CCCG 2012: 199-204
• 2011
• 
  Carsten Frey, Christoph Kutza, Marcus Pflanz, Rolf Kruse, Paul Grimm:
  Assemblee Virtuell. MuC 2011: 301-304
• 2009
• 
  Takehiro Hashimoto, Michiel J. L. de Hoon, Sean M. Grimmond, Carsten O. Daub, Yoshihide Hayashizaki, Geoffrey J. Faulkner:
  Probabilistic resolution of multi-mapping reads in massively parallel sequencing data using MuMRescueLite. Bioinform. 25(19): 2613-2614 (2009)