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

• 2018
• 
  Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
  Sublinear approximation algorithms for boxicity and related problems. Discret. Appl. Math. 236: 7-22 (2018)
• 
  Talha Amin, Mikhail Moshkov:
  Totally optimal decision rules. Discret. Appl. Math. 236: 453-458 (2018)
• 
  Toru Araki, Issei Yumoto:
  On the secure domination numbers of maximal outerplanar graphs. Discret. Appl. Math. 236: 23-29 (2018)
• 
  Niranjan Balachandran, Sajith Padinhatteeri:
  The list distinguishing number of Kneser graphs. Discret. Appl. Math. 236: 30-41 (2018)
• 
  Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
  A faster parameterized algorithm for Pseudoforest Deletion. Discret. Appl. Math. 236: 42-56 (2018)
• 
  Andreas Brandstädt, Raffaele Mosca:
  Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time. Discret. Appl. Math. 236: 57-65 (2018)
• 
  Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer, Elkin Vumar:
  On upper bounds for the independent transversal domination number. Discret. Appl. Math. 236: 66-72 (2018)
• 
  Clément Charpentier, Brice Effantin, Gabriela Paris:
  On the game coloring index of -decomposable graphs. Discret. Appl. Math. 236: 73-83 (2018)
• 
  Shuya Chiba, Nicolas Lichiardopol:
  On the existence of vertex-disjoint subgraphs with high degree sum. Discret. Appl. Math. 236: 84-95 (2018)
• 
  Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk:
  A hierarchical framework for recovery in compressive sensing. Discret. Appl. Math. 236: 96-107 (2018)
• 
  Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei:
  Terminal-pairability in complete bipartite graphs. Discret. Appl. Math. 236: 459-463 (2018)
• 
  Jared Culbertson, Dan P. Guralnik, Peter F. Stiller:
  Functorial hierarchical clustering with overlaps. Discret. Appl. Math. 236: 108-123 (2018)
• 
  Benoît Darties, Nicolas Gastineau, Olivier Togni:
  Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees. Discret. Appl. Math. 236: 124-136 (2018)
• 
  Pietra Delgado-Escalante, Hortensia Galeana-Sánchez, Eugenia O'Reilly Regueiro:
  Alternating kernels. Discret. Appl. Math. 236: 153-164 (2018)
• 
  Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca:
  Some forbidden combinations of branches in minimal-ABC trees. Discret. Appl. Math. 236: 165-182 (2018)
• 
  Carl Feghali, Matthew Johnson, Daniel Thomas:
  Erdős-Ko-Rado theorems for a family of trees. Discret. Appl. Math. 236: 464-471 (2018)
• 
  Henning Fernau, Juan A. Rodríguez-Velázquez:
  On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results. Discret. Appl. Math. 236: 183-202 (2018)
• 
  Michael Gentner, Dieter Rautenbach:
  Some bounds on the zero forcing number of a graph. Discret. Appl. Math. 236: 203-213 (2018)
• 
  Martin Charles Golumbic, Gila Morgenstern, Deepak Rajendraprasad:
  Edge-intersection graphs of boundary-generated paths in a grid. Discret. Appl. Math. 236: 214-222 (2018)
• 
  Alain Goupil, Marie-Eve Pellerin, Jérôme de Wouters d'oplinter:
  Partially directed snake polyominoes. Discret. Appl. Math. 236: 223-234 (2018)
• 
  Michael A. Henning, Marcin Krzywkowski:
  Total domination stability in graphs. Discret. Appl. Math. 236: 246-255 (2018)
• 
  Michael A. Henning, William F. Klostermeyer, Gary MacGillivray:
  Perfect Roman domination in trees. Discret. Appl. Math. 236: 235-245 (2018)
• 
  Mirko Hornák, Jakub Przybylo, Mariusz Wozniak:
  A note on a directed version of the 1-2-3 Conjecture. Discret. Appl. Math. 236: 472-476 (2018)
• 
  Viktória E. Kaszanitzky, Bernd Schulze:
  Characterizing minimally flat symmetric hypergraphs. Discret. Appl. Math. 236: 256-269 (2018)
• 
  Dorota Kuziak, María Luz Puertas, Juan A. Rodríguez-Velázquez, Ismael González Yero:
  Strong resolving graphs: The realization and the characterization problems. Discret. Appl. Math. 236: 270-287 (2018)
• 
  Hui Lei, Henry Liu, Colton Magnant, Yongtang Shi:
  Total rainbow connection of digraphs. Discret. Appl. Math. 236: 288-305 (2018)
• 
  Wen An Liu, Jing Jing Zhou:
  Multi-player Small Nim with Passes. Discret. Appl. Math. 236: 306-314 (2018)
• 
  Mehar Ali Malik:
  Two degree-distance based topological descriptors of some product graphs. Discret. Appl. Math. 236: 315-328 (2018)
• 
  Bimal Mandal, Bhupendra Singh, Sugata Gangopadhyay, Subhamoy Maitra, Vellaichamy Vetrivel:
  On non-existence of bent-negabent rotation symmetric Boolean functions. Discret. Appl. Math. 236: 1-6 (2018)
• 
  A. D. Matushkin, Maksim E. Zhukovskii:
  First order sentences about random graphs: Small number of alternations. Discret. Appl. Math. 236: 329-346 (2018)

skipping 10 more matches