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

• 2023
• 
  Ruben Ascoli, Livia Betti, Jacob Lehmann Duke, Xuyan Liu, Wyatt Milgrim, Steven J. Miller, Eyvindur A. Palsson, Francisco Romero Acosta, Santiago Velazquez Iannuzzelli:
  Distinct Angles and Angle Chains in Three Dimensions. Discret. Math. Theor. Comput. Sci. 25 (2023)
• 
  Iztok Banic, Andrej Taranenko:
  Span of a Graph: Keeping the Safety Distance. Discret. Math. Theor. Comput. Sci. 25 (2023)
• 
  Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
  New Results on Directed Edge Dominating Set. Discret. Math. Theor. Comput. Sci. 25 (2023)
• 
  Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder:
  Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. Discret. Math. Theor. Comput. Sci. 25 (2023)
• 
  Sylwia Cichacz, Karol Suchan:
  Zero-sum partitions of Abelian groups of order $2n$. Discret. Math. Theor. Comput. Sci. 25 (2023)
• 
  Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
  Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. Discret. Math. Theor. Comput. Sci. 25 (2023)
• 
  Juan Carlos García-Altamirano, Mika Olsen, Jorge Cervantes-Ojeda:
  How to construct the symmetric cycle of length 5 using Hajós construction with an adapted Rank Genetic Algorithm. Discret. Math. Theor. Comput. Sci. 25 (2023)
• 
  Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman:
  Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs. Discret. Math. Theor. Comput. Sci. 25 (2023)
• 2022
• 
  Isolde Adler, Noleen Köhler:
  An explicit construction of graphs of bounded degree that are far from being Hamiltonian. Discret. Math. Theor. Comput. Sci. 24(1) (2022)
• 
  Andrei Asinowski, Benjamin Hackl, Sarah J. Selkirk:
  Down-step statistics in generalized Dyck paths. Discret. Math. Theor. Comput. Sci. 24(1) (2022)
• 
  Julien Baste, Stefan Ehard, Dieter Rautenbach:
  Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree. Discret. Math. Theor. Comput. Sci. 24(1) (2022)
• 
  Rémy Belmonte, Michael Lampis, Valia Mitsou:
  Defective Coloring on Classes of Perfect Graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022)
• 
  Helena Bergold, Winfried Hochstättler, Uwe Mayer:
  The Neighborhood Polynomial of Chordal Graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022)
• 
  Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte:
  Token Swapping on Trees. Discret. Math. Theor. Comput. Sci. 24(2) (2022)
• 
  Daniel Birmajer, Juan B. Gil, David S. Kenepp, Michael D. Weiner:
  Restricted generating trees for weak orderings. Discret. Math. Theor. Comput. Sci. 24(1) (2022)
• 
  Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa:
  Tuza's Conjecture for Threshold Graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022)
• 
  Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin, David R. Wood:
  Separating layered treewidth and row treewidth. Discret. Math. Theor. Comput. Sci. 24(1) (2022)
• 
  Lukasz Bozyk, Michal Pilipczuk:
  On the Erdős-Pósa property for immersions and topological minors in tournaments. Discret. Math. Theor. Comput. Sci. 24(1) (2022)
• 
  Anna M. Brandenberger, Luc Devroye, Marcel K. Goh, Rosie Zhao:
  Leaf multiplicity in a Bienaymé-Galton-Watson tree. Discret. Math. Theor. Comput. Sci. 24(1) (2022)
• 
  Richard C. Brewster, Arnott Kidner, Gary MacGillivray:
  The 2-colouring problem for (m,n)-mixed graphs with switching is polynomial. Discret. Math. Theor. Comput. Sci. 24(2) (2022)
• 
  Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
  On the domination number of $t$-constrained de Bruijn graphs. Discret. Math. Theor. Comput. Sci. 24(2) (2022)
• 
  Márcia R. Cappelle, Erika M. M. Coelho, Les R. Foulds, Humberto J. Longo:
  Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022)
• 
  Yen Hung Chen:
  Approximability results for the $p$-centdian and the converse centdian problems. Discret. Math. Theor. Comput. Sci. 24(2) (2022)
• 
  Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu:
  Proximity, remoteness and maximum degree in graphs. Discret. Math. Theor. Comput. Sci. 24(2) (2022)
• 
  Angsuman Das, Hiranya Kishore Dey:
  Determining Number of Kneser Graphs: Exact Values and Improved Bounds. Discret. Math. Theor. Comput. Sci. 24(1) (2022)
• 
  Marc Distel, Robert Hickingbotham, Tony Huynh, David R. Wood:
  Improved product structure for graphs on surfaces. Discret. Math. Theor. Comput. Sci. 24(2) (2022)
• 
  Mitre Costa Dourado, Vitor S. Ponciano, Rômulo L. O. da Silva:
  On the monophonic rank of a graph. Discret. Math. Theor. Comput. Sci. 24(2) (2022)
• 
  Khaled M. Elbassioni:
  On Dualization over Distributive Lattices. Discret. Math. Theor. Comput. Sci. 24(2) (2022)
• 
  Wenjie Fang:
  Efficient recurrence for the enumeration of permutations with fixed pinnacle set. Discret. Math. Theor. Comput. Sci. 24(1) (2022)
• 
  Jovana Forcan, Mirjana Mikalacki:
  Maker-Breaker total domination game on cubic graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022)

skipping 839 more matches