default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics & Theoretical Computer Science, Volume 27
Volume 27, Number 1, 2025
- Toufik Mansour
, Howard Skogman, Rebecca Smith:
Sorting inversion sequences.
Volume 27, Number 2, 2025
- Margaret-Ellen Messinger, Amanda Porter:
Eulerian $k$-dominating reconfiguration graphs. - France Gheeraert, Julien Leroy:
$\mathcal{S}$-adic characterization of minimal dendric shifts. - Oksana Firman, Joachim Spoerhase:
Hypergraph Representation via Axis-Aligned Point-Subspace Cover. - Israel R. Curbelo, Hannah R. Malko:
On the on-line coloring of unit interval graphs with proper interval representation. - Giuseppe Di Battista, Fabrizio Frati:
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs. - Marc Distel, Kevin Hendrey, Nikolai Karol, David R. Wood, Jung Hon Yip:
Treewidth 2 in the Planar Graph Product Structure Theorem. - Marcin Pilipczuk, Pawel Rzazewski:
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number. - Maël Dumas, Anthony Perez, Mathis Rocton, Ioan Todinca:
Polynomial kernels for edge modification problems towards block and strictly chordal graphs. - Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze:
Approximating Maximum Edge 2-Coloring by Normalizing Graphs. - Lorenzo Balzotti:
Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs. - Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky:
On Separating Path and Tree Systems in Graphs. - Aditya Y. Dalwadi, Kapil R. Shenvi Pause, Ajit A. Diwan, Nishad Kothari:
Planar cycle-extendable graphs. - Robert Hickingbotham:
Cop-width, flip-width and strong colouring numbers. - Katharina T. Huber, Simone Linz, Vincent Moulton:
Cherry picking in forests: A new characterization for the unrooted hybrid number of two phylogenetic trees. - Mojtaba Ostovari, Alireza Zarei:
Improved Combinatorial Approximations for Weighted Correlation Clustering. - Luisa Gargano, Adele A. Rescigno:
Spanning Trees Minimizing Branching Costs.
Volume 27, Number 3, 2025
- Pascal Ochem, Théo Pierron:
4-tangrams are 4-avoidable. - Bostjan Bresar, Sandi Klavzar, Babak Samadi:
Total $k$-coalition: bounds, exact values and an application to double coalition. - Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter:
The Price of Upwardness. - Péter Ágoston, Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi:
Orientation of good covers. - Konstantinos Georgiou, Somnath Kundu, Pawel Pralat:
The Fagnano Triangle Patrolling Problem. - Julien Bensmail, Clara Marcille, Mano Orenga:
Pushing Vertices to Make Graphs Irregular. - Markus Lohrey, Andreas Rosowski:
Parameterized Complexity of Factorization Problems. - Carole Porrier, Alain Goupil, Alexandre Blondin Massé:
The Leaf Function of Penrose P2 Graphs. - Kalpana Mahalingam, Anuran Maity:
Watson-Crick conjugates of words and languages. - Jiafu He, Haiyu Zeng, Yanbo Zhang:
Ramsey goodness of stars and fans for the Hajós graph. - Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, Piotr Micek:
Shallow brambles. - Pascal Ochem, Matthieu Rosenfeld:
Words avoiding the morphic images of most of their factors. - Thomas C. Hull, Adham Ibrahim, Jacob Paltrowitz, Natalya Ter-Saakov, Grace Wang:
The Stamp Folding Problem From a Mountain-Valley Perspective. - James D. Currie, Narad Rampersad:
Low complexity binary words avoiding $(5/2)^+$-powers. - Bostjan Bresar, Csilla Bujtás, Pakanun Dokyeesun, Tanja Dravec:
Thresholds for the biased Maker-Breaker domination games.
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-12-04 01:27 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:
