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

• 2023
• 
  Maria Axenovich:
  Extremal numbers for cycles in a hypercube. Discret. Appl. Math. 341: 1-3 (2023)
• 
  Evripidis Bampis, Bruno Escoffier, Paul Youssef:
  Online 2-stage stable matching. Discret. Appl. Math. 341: 394-405 (2023)
• 
  Farah Ben-Naoum, Christophe Godin, Romain Azaïs:
  Characterization of random walks on space of unordered trees using efficient metric simulation. Discret. Appl. Math. 341: 290-307 (2023)
• 
  Ez-Zobair Bidine, Taoufiq Gadi, Mustapha Kchikech:
  The exponential growth of the packing chromatic number of iterated Mycielskians. Discret. Appl. Math. 341: 232-241 (2023)
• 
  April Chen, Nathan Kaplan, Liam Lawson, Christopher O'Neill, Deepesh Singhal:
  Enumerating numerical sets associated to a numerical semigroup. Discret. Appl. Math. 341: 218-231 (2023)
• 
  Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle:
  Treelength of series-parallel graphs. Discret. Appl. Math. 341: 16-30 (2023)
• 
  John Engbers, Aysel Erey:
  Extremal graphs for average sizes of maximal matchings. Discret. Appl. Math. 341: 308-321 (2023)
• 
  Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Orlando Lee:
  Preface: LAGOS'21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil. Discret. Appl. Math. 341: 393 (2023)
• 
  Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
  On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341: 196-203 (2023)
• 
  Shu-Guang Guo, Rong Zhang:
  Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size. Discret. Appl. Math. 341: 204-211 (2023)
• 
  Erika Hanaoka, Taizo Sadahiro:
  The 5-puzzle doubly covers the soccer ball. Discret. Appl. Math. 341: 164-168 (2023)
• 
  Shenwei Huang, Zeyu Li:
  Vertex-critical (P5,chair)-free graphs. Discret. Appl. Math. 341: 9-15 (2023)
• 
  Stefan Kratsch, Florian Nelles:
  Efficient parameterized algorithms for computing all-pairs shortest paths. Discret. Appl. Math. 341: 102-119 (2023)
• 
  Vikas Kumar, Bimal Mandal, Aditi Kar Gangopadhyay:
  On the Gowers U2 and U3 norms of Boolean functions and their restriction to hyperplanes. Discret. Appl. Math. 341: 4-8 (2023)
• 
  Ke Li, Zhao Zhang:
  Approximation algorithm for (connected) Italian dominating function. Discret. Appl. Math. 341: 169-179 (2023)
• 
  Xia Liu, Hong-Jian Lai:
  Hamilton-connected claw-free graphs with Ore-degree conditions. Discret. Appl. Math. 341: 130-139 (2023)
• 
  Xin Liu, Yu Pan, Yu Ding, Zhisong Pan:
  Distributed One-Pass Online AUC Maximization. Discret. Appl. Math. 341: 322-336 (2023)
• 
  Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos:
  Edge-treewidth: Algorithmic and combinatorial properties. Discret. Appl. Math. 341: 40-54 (2023)
• 
  Javier Marenco:
  An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers. Discret. Appl. Math. 341: 180-195 (2023)
• 
  Erin Meger, Abigail Raz:
  The iterative independent model. Discret. Appl. Math. 341: 242-256 (2023)
• 
  Dylan Laplace Mermoud, Michel Grabisch, Peter Sudhölter:
  Minimal balanced collections and their application to core stability and other topics of game theory. Discret. Appl. Math. 341: 60-81 (2023)
• 
  Hirotaka Ono, Hisato Yamanaka:
  An 8-approximation algorithm for L(2,1)-labeling of unit disk graphs. Discret. Appl. Math. 341: 93-101 (2023)
• 
  B. S. Panda, Pooja Goyal:
  Hardness results of global roman domination in graphs. Discret. Appl. Math. 341: 337-348 (2023)
• 
  Maithilee Patawar, Kalpesh Kapoor:
  The square density of words having a sequence of FS-double squares. Discret. Appl. Math. 341: 349-358 (2023)
• 
  Liat Peterfreund:
  Enumerating grammar-based extractions. Discret. Appl. Math. 341: 372-392 (2023)
• 
  William Sims, Meera Sitharam:
  Flip paths between lattice triangulations. Discret. Appl. Math. 341: 140-163 (2023)
• 
  Lama Tarsissi, Yukiko Kenmochi, Pascal Romon, David Coeurjolly, Jean-Pierre Borel:
  Convexity preserving deformations of digital sets: Characterization of removable and insertable pixels. Discret. Appl. Math. 341: 270-289 (2023)
• 
  Mirko Wilde, Mareike Fischer:
  Defining binary phylogenetic trees using parsimony: New bounds. Discret. Appl. Math. 341: 257-269 (2023)
• 
  Na Yang, Jian-Hua Yin:
  Group connectivity of graphs satisfying the Chvátal-condition. Discret. Appl. Math. 341: 212-217 (2023)
• 
  Andrzej Zak:
  A note on the integrity of grids. Discret. Appl. Math. 341: 55-59 (2023)

skipping 4 more matches