default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics & Theoretical Computer Science, Volume 25
Volume 25, Number 1, 2023
- Stefan Balev, Juan Luis Jiménez Laredo, Ioannis Lamprou, Yoann Pigné, Eric Sanlaville:
Cops and Robbers on Dynamic Graphs: Offline and Online Case. - 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. - 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. - Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
New Results on Directed Edge Dominating Set. - Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder:
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. - Sylwia Cichacz, Karol Suchan:
Zero-sum partitions of Abelian groups of order 2n. - Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. - Iztok Banic, Andrej Taranenko:
Span of a Graph: Keeping the Safety Distance. - 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. - Cláudio Carvalho, Jonas Costa, Raul Lopes, Ana Karolinna Maia, Nicolas Nisse, Cláudia Linhares Sales:
From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows. - Yiqiao Wang, Ning Song, Jianfeng Wang, Weifan Wang:
The strong chromatic index of 1-planar graphs. - Altar Çiçeksiz, Yunus Emre Demirci, Ümit Islak:
The Variance and the Asymptotic Distribution of the Length of Longest k-alternating Subsequences. - Peixue Zhao, Fei Huang:
Rainbow vertex pair-pancyclicity of strongly edge-colored graphs. - Tatjana Zec, Milana Grbic:
Several Roman domination graph invariants on Kneser graphs. - Balázs Keszegh:
A new discrete theory of pseudoconvexity. - Nevil Anto, Manu Basavaraju:
Gallai's Path Decomposition for 2-degenerate Graphs. - Rudolf Grübel:
A note on limits of sequences of binary trees. - William Pettersson, John Sylvester:
Bounds on the Twin-Width of Product Graphs.
Volume 25, Number 2, 2023
- Gary MacGillivray, Shahla Nasserasr, Feiran Yang:
Colourings of (m, n)-coloured mixed graphs. - Matthias Beck, Sampada Kolhatkar:
Bivariate Chromatic Polynomials of Mixed Graphs. - Guy Louchard, Werner Schachinger, Mark Daniel Ward:
The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis. - Leo van Iersel, Mark Jones, Mathias Weller:
Embedding phylogenetic trees in networks of low treewidth. - Jean-Claude Bermond, Takako Kodate, Joseph Yu:
Gossiping with interference in radio ring networks. - Joseph Meleshko, Pascal Ochem, Jeffrey O. Shallit, Sonja Linghui Shan:
Pseudoperiodic Words and a Question of Shevelev. - Václav Blazej, Pavel Dvorák, Michal Opler:
Bears with Hats and Independence Polynomials. - Josef Rukavicka:
Dissecting power of intersection of two context-free languages. - Christof Löding, Sarah Winter:
Resynchronized Uniformization and Definability Problems for Rational Relations. - Pierre Lescanne:
Holonomic equations and efficient random generation of binary trees. - Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Antisquares and Critical Exponents. - Csilla Bujtás, Pakanun Dokyeesun, Sandi Klavzar:
Maker-Breaker domination game on trees when Staller wins. - Thomas Bellitto, Christopher Duffy, Gary MacGillivray:
Homomorphically Full Oriented Graphs. - Geoffrey Exoo:
On Mixed Cages. - Mostafa Gholami, Yaser Rowshan:
The bipartite Ramsey numbers BR(C8, C2n). - Benjamin Braun, Kaitlin Bruegge, Matthew Kahle:
Facets of Random Symmetric Edge Polytopes, Degree Sequences, and Clustering. - Mehri Javanian, Rafik Aguech:
On the protected nodes in exponential recursive trees. - Simon B. Hengeveld, Tillmann Miltzow:
A Practical Algorithm with Performance Guarantees for the Art Gallery Problem. - Jie Zhang, Zhilan Wang, Jin Yan:
A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles. - Toufik Mansour, Gökhan Yildirim:
Inversion sequences avoiding 021 and another pattern of length four. - Aaron Slobodin, Gary MacGillivray, Wendy J. Myrvold:
Proving exact values for the 2-limited broadcast domination number on grid graphs. - Janis Iraids, Juris Smotrovs:
Representing polynomial of ST-CONNECTIVITY. - Jovana Forcan, Jiayue Qi:
Maker-Breaker domination number for Cartesian products of path graphs P2 and Pn. - Daniel Chen, Sebastian Ohlig:
Associated Permutations of Complete Non-Ambiguous Trees. - Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. - Mitre Costa Dourado, Vitor S. Ponciano, Rômulo L. O. da Silva:
Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]. - Robert Schwieger, Elisa Tonello:
Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components.
Volume 25, Number 3, 2023
Special Issue ICGT'22
- Gyula Y. Katona, Kitti Varga:
Minimal toughness in special graph classes. - Florian Galliot, Sylvain Gravier, Isabelle Sivignon:
(k - 2)-linear connected components in hypergraphs of rank k. - Frank Göring, Tobias Hofmann:
Properties of uniformly 3-connected graphs. - François Pitois, Mohammed Haddad, Hamida Seba, Olivier Togni:
Hypergraphs with Polynomial Representation: Introducing r-splits. - Daniel Gonçalves, Vincent Limouzy, Pascal Ochem:
Contact graphs of boxes with unidirectional contacts. - S. M. Dhannya, N. S. Narayanaswamy, K. K. Nisha:
Exactly Hittable Interval Graphs.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-25 23:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
