• 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

• 2022
• 
  A. Karim Abu-Affash, Paz Carmi, Adi Krasin:
  A linear-time algorithm for minimum k-hop dominating set of a cactus graph. Discret. Appl. Math. 320: 488-499 (2022)
• 
  L. Bayón, Pedro Fortuny Ayuso, J. M. Grau, Antonio M. Oller-Marcén, M. M. Ruiz:
  The multi-returning secretary problem. Discret. Appl. Math. 320: 33-46 (2022)
• 
  Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille:
  Going Wide with the 1-2-3 Conjecture. Discret. Appl. Math. 320: 15-32 (2022)
• 
  Helena Bergold, Winfried Hochstättler, Raphael Steiner:
  Colorings of oriented planar graphs avoiding a monochromatic subgraph. Discret. Appl. Math. 320: 81-94 (2022)
• 
  Bojana Borovicanin, Boris Furtula, Marija Jerotijevic:
  On the minimum Harary index of graphs with a given diameter or independence number. Discret. Appl. Math. 320: 331-345 (2022)
• 
  Christoph Brause, Maximilian Geißer, Ingo Schiermeyer:
  Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions. Discret. Appl. Math. 320: 211-222 (2022)
• 
  Shao-Liang Chen, Rong-Xia Hao, Xiao-Wen Qin:
  Bounds for the connected domination number of maximal outerplanar graphs. Discret. Appl. Math. 320: 235-244 (2022)
• 
  Sujing Cheng, Wuxian Chen, Weigen Yan:
  A type of generalized mesh-star transformation and applications in electrical networks. Discret. Appl. Math. 320: 259-269 (2022)
• 
  Trung Duy Doan, Ingo Schiermeyer:
  The proper 2-connection number and size of graphs. Discret. Appl. Math. 320: 296-303 (2022)
• 
  Yoshimi Egawa, Michitaka Furuya:
  Forbidden triples generating a finite set of graphs with minimum degree three. Discret. Appl. Math. 320: 282-295 (2022)
• 
  Mostafa Einollahzadeh, Mohammad Ali Nematollahi:
  An improved lower bound for the Seidel energy of trees. Discret. Appl. Math. 320: 381-386 (2022)
• 
  Emily J. Evans, Amanda E. Francis:
  Algorithmic techniques for finding resistance distances on structured graphs. Discret. Appl. Math. 320: 387-407 (2022)
• 
  Min Feng, Xuanlong Ma, Lihua Feng:
  Optimal identifying codes of two families of Cayley graphs. Discret. Appl. Math. 320: 199-210 (2022)
• 
  András Frank, Kazuo Murota:
  Fair integral submodular flows. Discret. Appl. Math. 320: 416-434 (2022)
• 
  Rafael M. Frongillo, Jesse Geneson, Manuel E. Lladser, Richard C. Tillquist, Eunjeong Yi:
  Truncated metric dimension for finite graphs. Discret. Appl. Math. 320: 150-169 (2022)
• 
  Bin Fu, Yumei Huo, Hairong Zhao:
  Streaming algorithms for multitasking scheduling with shared processing. Discret. Appl. Math. 320: 346-355 (2022)
• 
  Michael Fuchs, En-Yu Huang, Guan-Ru Yu:
  Counting phylogenetic networks with few reticulation vertices: A second approach. Discret. Appl. Math. 320: 140-149 (2022)
• 
  Mohammad Farrokhi Derakhshandeh Ghouchan, Shekoofeh Gharakhloo, Ali Akbar Yazdan Pour:
  Positive matching decompositions of graphs. Discret. Appl. Math. 320: 311-323 (2022)
• 
  Christian Go, Khwa Zhong Xuan, Xinyu Luo, Matthew T. Stamps:
  Spanning tree enumeration and nearly triangular graph Laplacians. Discret. Appl. Math. 320: 356-369 (2022)
• 
  Wayne Goddard, Kirsti Kuenzel, Eileen Melville:
  Well-hued graphs. Discret. Appl. Math. 320: 370-380 (2022)
• 
  Ilan A. Goldfeder, Nahid Y. Javier-Nol, Joaquín Tey:
  A family of bipartite circulant tournaments with acyclic disconnection 3. Discret. Appl. Math. 320: 324-330 (2022)
• 
  Shu-Guang Guo, Rong Zhang:
  Sharp upper bounds on the Q-index of (minimally) 2-connected graphs with given size. Discret. Appl. Math. 320: 408-415 (2022)
• 
  Florian Hörsch, Zoltán Szigeti:
  Reachability in arborescence packings. Discret. Appl. Math. 320: 170-183 (2022)
• 
  Rikio Ichishima, Francesc A. Muntaner-Batle, Akito Oshima:
  Minimum degree conditions for the strength and bandwidth of graphs. Discret. Appl. Math. 320: 191-198 (2022)
• 
  William B. Kinnersley, Nikolas Townsend:
  Catching an infinitely fast robber on a grid. Discret. Appl. Math. 320: 446-461 (2022)
• 
  Lan Lei, Xiaoming Li, Yang Wu, Taoye Zhang, Hong-Jian Lai:
  Strengthened Ore conditions for (s, t)-supereulerian graphs. Discret. Appl. Math. 320: 68-80 (2022)
• 
  Haiyan Li, Wen An Liu:
  Adjoining to (K, s, t)-Wythoff's game its P-generators as moves. Discret. Appl. Math. 320: 476-487 (2022)
• 
  Pierrick Méaux:
  On the algebraic immunity of direct sum constructions. Discret. Appl. Math. 320: 223-234 (2022)
• 
  Theodore Molla, Michael Santana:
  Disjoint cycles in graphs with restricted independence number. Discret. Appl. Math. 320: 95-105 (2022)
• 
  Daniele Mundici:
  The read once formula of a series-parallel network. Discret. Appl. Math. 320: 304-310 (2022)

skipping 10 more matches