• 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 9,902 matches

• 2025
• 
  Geir Agnarsson, Elie Alhajjar, Aleyah Dawkins:
  On locally finite ordered rooted trees and their rooted subtrees. Discret. Appl. Math. 360: 1-21 (2025)
• 
  Yasir Ahmad, Xiang-Feng Pan, Umar Ali, Zhuo Diao:
  Computing the expected value of invariants based on resistance distance for random spiro-polynomio chains. Discret. Appl. Math. 361: 111-120 (2025)
• 
  Tobias Boege, Janneke H. Bolt, Milan Studený:
  Self-adhesivity in lattices of abstract conditional independence models. Discret. Appl. Math. 361: 196-225 (2025)
• 
  Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt, Rita Zuazua:
  On interval colouring reorientation number of oriented graphs. Discret. Appl. Math. 360: 65-80 (2025)
• 
  Fábio Botler, Wanderson Lomenha, João Pedro de Souza:
  On nonrepetitive colorings of paths and cycles. Discret. Appl. Math. 360: 221-228 (2025)
• 
  Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
  Well-indumatched Pseudoforests. Discret. Appl. Math. 361: 85-102 (2025)
• 
  Steven Chaplick, Martin Frohn, Steven Kelk, Johann Lottermoser, Matús Mihalák:
  Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs. Discret. Appl. Math. 360: 275-281 (2025)
• 
  Xiaodong Chen, Jiayuan Zhang, Liming Xiong, Guifu Su:
  Every 2-connected {claw, Z2}-free graph with minimum degree at least 4 contains two CISTs. Discret. Appl. Math. 360: 51-64 (2025)
• 
  Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein:
  New results on edge-coloring and total-coloring of split graphs. Discret. Appl. Math. 360: 297-306 (2025)
• 
  Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
  An efficient algorithm for group testing with runlength constraints. Discret. Appl. Math. 360: 181-187 (2025)
• 
  Kinkar Chandra Das, Da-yeon Huh, Jayanta Bera, Sourav Mondal:
  Study on geometric-arithmetic, arithmetic-geometric and Randić indices of graphs. Discret. Appl. Math. 360: 229-245 (2025)
• 
  Zakir Deniz:
  An improved bound for 2-distance coloring of planar graphs with girth six. Discret. Appl. Math. 361: 121-135 (2025)
• 
  Kamal Dliou:
  Independence, matching and packing coloring of the iterated Mycielskian of graphs. Discret. Appl. Math. 361: 22-33 (2025)
• 
  Mitre Costa Dourado, Marisa Gutierrez, Fábio Protti, Rudini Menezes Sampaio, Silvia B. Tondato:
  Characterizations of graph classes via convex geometries: A survey. Discret. Appl. Math. 360: 246-257 (2025)
• 
  Jiacong Fu, Jian-Bo Lv:
  On injective edge-coloring of graphs with maximum degree 4. Discret. Appl. Math. 360: 119-130 (2025)
• 
  Jing Gao, Xueliang Li, Ning Yang, Ruiling Zheng:
  Maximum energy bicyclic graphs containing two odd cycles with one common vertex. Discret. Appl. Math. 361: 1-21 (2025)
• 
  Hyoungjun Kim, Thomas Mattman:
  Dips at small sizes for topological graph obstruction sets. Discret. Appl. Math. 360: 139-166 (2025)
• 
  Xiaoyan Lai, Yishuo Shi:
  Approximation algorithm of maximizing non-submodular functions under non-submodular constraint. Discret. Appl. Math. 361: 48-68 (2025)
• 
  Jing Lou, Ruifang Liu, Jinlong Shu:
  Toughness and distance spectral radius in graphs involving minimum degree. Discret. Appl. Math. 361: 34-47 (2025)
• 
  Xiaoyun Lv, Jianxi Li, Shou-Jun Xu:
  Some results on {K2,C2i+1:i≥1}-factor in a graph. Discret. Appl. Math. 360: 81-92 (2025)
• 
  Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
  Recognizing unit multiple interval graphs is hard. Discret. Appl. Math. 360: 258-274 (2025)
• 
  Sean McGuinness:
  Serial exchanges in random bases. Discret. Appl. Math. 361: 103-110 (2025)
• 
  Kazuo Murota, Akihisa Tamura:
  Shapley-Folkman-type theorem for integrally convex sets. Discret. Appl. Math. 360: 42-50 (2025)
• 
  Alexandr Polujan, Luca Mariot, Stjepan Picek:
  On two open problems on the normality of bent functions. Discret. Appl. Math. 360: 115-118 (2025)
• 
  Weimin Qian, Feng Li:
  Exact vertex forwarding index of the Strong product of complete graph and cycle. Discret. Appl. Math. 361: 69-84 (2025)
• 
  Bilal Ahmad Rather, Mustapha Aouchiche:
  Distance Laplacian spectra of graphs: A survey. Discret. Appl. Math. 361: 136-195 (2025)
• 
  Robert Scheffler:
  Semi-proper interval graphs. Discret. Appl. Math. 360: 22-41 (2025)
• 
  S. Shyama, Radha R. Iyer:
  Unraveling the enigmatic irregular coloring of Honeycomb Networks. Discret. Appl. Math. 360: 282-296 (2025)
• 
  Jing Wang, Jiang Wu, Zhangdong Ouyang, Yuanqiu Huang:
  The generalized 4-connectivity of burnt pancake graphs. Discret. Appl. Math. 360: 93-114 (2025)
• 
  Yuehan Wu, Chengxi Hong, Peifang Fu, Wenshui Lin:
  Large trees with maximal inverse sum indeg index have no vertices of degree 2 or 3. Discret. Appl. Math. 360: 131-138 (2025)

skipping 9,872 more matches