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

• 2015
• 
  Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Seongmin Ok, Patrick Solé, Carsten Thomassen:
  The minimum number of minimal codewords in an [n, k]-code and in graphic codes. Discret. Appl. Math. 184: 32-39 (2015)
• 
  N. R. Aravind, Subrahmanyam Kalyanasundaram, R. B. Sandeep, Naveen Sivadasan:
  The chromatic discrepancy of graphs. Discret. Appl. Math. 184: 40-49 (2015)
• 
  Sylvain Béal, Eric Rémila, Philippe Solal:
  A decomposition of the space of TU-games using addition and transfer invariance. Discret. Appl. Math. 184: 1-13 (2015)
• 
  Anne Berry, Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray:
  Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. Discret. Appl. Math. 184: 50-61 (2015)
• 
  Monica Bianchi, Alessandra Cornaro, José Luis Palacios, Anna Torriero:
  New bounds of degree-based topological indices for some classes of c-cyclic graphs. Discret. Appl. Math. 184: 62-75 (2015)
• 
  Monther Busbait, Igor Chikalov, Shahid Hussain, Mikhail Ju. Moshkov:
  Diagnosis of constant faults in read-once contact networks over finite bases. Discret. Appl. Math. 184: 76-88 (2015)
• 
  Martin C. Cooper, Guillaume Escamocher:
  Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns. Discret. Appl. Math. 184: 89-113 (2015)
• 
  Vítor Costa, Simone Dantas, Dieter Rautenbach:
  Asymptotic surviving rate of trees with multiple fire sources. Discret. Appl. Math. 184: 14-19 (2015)
• 
  Peter Dankelmann:
  Proximity, remoteness and minimum degree. Discret. Appl. Math. 184: 223-228 (2015)
• 
  N. Safina Devi, Aniket C. Mane, Sounaka Mishra:
  Computational complexity of minimum P4 vertex cover problem for regular and K1, 4-free graphs. Discret. Appl. Math. 184: 114-121 (2015)
• 
  Jean-Luc Fouquet, Frédéric Maffray:
  Domination, coloring and stability in P5-reducible graphs. Discret. Appl. Math. 184: 122-129 (2015)
• 
  Tobias Friedrich, Anton Krohmer:
  Parameterized clique on inhomogeneous random graphs. Discret. Appl. Math. 184: 130-138 (2015)
• 
  Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma:
  Pebble exchange on graphs. Discret. Appl. Math. 184: 139-145 (2015)
• 
  Michitaka Furuya:
  A note on total domination and 2-rainbow domination in graphs. Discret. Appl. Math. 184: 229-230 (2015)
• 
  Andrei V. Gagarin, Vadim E. Zverovich:
  The probabilistic approach to limited packings in graphs. Discret. Appl. Math. 184: 146-153 (2015)
• 
  Modjtaba Ghorbani, Nasrin Azimi:
  Characterization of split graphs with at most four distinct eigenvalues. Discret. Appl. Math. 184: 231-236 (2015)
• 
  Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
  Approximate tradeoffs on weighted labeled matroids. Discret. Appl. Math. 184: 154-166 (2015)
• 
  Hao Gui, Weifan Wang, Yiqiao Wang, Zhao Zhang:
  Equitable total-coloring of subcubic graphs. Discret. Appl. Math. 184: 167-170 (2015)
• 
  Michael A. Henning, Sinclair A. Marcon:
  Domination versus disjunctive domination in trees. Discret. Appl. Math. 184: 171-177 (2015)
• 
  Gerold Jäger, Marcin Peczarski:
  The worst case number of questions in Generalized AB game with and without white-peg answers. Discret. Appl. Math. 184: 20-31 (2015)
• 
  Robert Janczewski, Krzysztof Turowski:
  The computational complexity of the backbone coloring problem for planar graphs with connected backbones. Discret. Appl. Math. 184: 237-242 (2015)
• 
  Yubo Jing, Yingqian Wang:
  (3, 1)-Choosability of toroidal graphs with some forbidden short cycles. Discret. Appl. Math. 184: 243-247 (2015)
• 
  Benjamin Kraft:
  Diameters of Cayley graphs generated by transposition trees. Discret. Appl. Math. 184: 178-188 (2015)
• 
  Atílio G. Luiz, C. N. Campos, Célia Picinin de Mello:
  AVD-total-colouring of complete equipartite graphs. Discret. Appl. Math. 184: 189-195 (2015)
• 
  José Luis Palacios:
  On the Kirchhoff index of graphs with diameter 2. Discret. Appl. Math. 184: 196-201 (2015)
• 
  Jelena Sedlar, Dragan Stevanovic, Alexander Vasilyev:
  On the inverse sum indeg index. Discret. Appl. Math. 184: 202-212 (2015)
• 
  Manami Shigeta, Kazuyuki Amano:
  Ordered biclique partitions and communication complexity problems. Discret. Appl. Math. 184: 248-252 (2015)
• 
  Michel Surmacs:
  Quasi-Hamiltonian cycles in k-strong multipartite tournaments. Discret. Appl. Math. 184: 253-257 (2015)
• 
  Shiying Wang, Nana Zhao:
  Degree conditions for graphs to be maximally k-restricted edge connected and super k-restricted edge connected. Discret. Appl. Math. 184: 258-263 (2015)
• 
  Baofeng Wu, Dongdai Lin:
  On constructing complete permutation polynomials over finite fields of even characteristic. Discret. Appl. Math. 184: 213-222 (2015)