default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 88
Volume 88, Number 1, February 2026
- Michaela Borzechowski, Patrick Schnider, Simon Weber:
An FPT Algorithm for Splitting a Necklace Among Two Thieves. 1 - Bogdan Alecu
, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev:
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. 2 - Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is $\exists \mathbb {R}$-Complete. 3 - Therese Biedl, Karthik Murali:
On computing vertex connectivity of 1-planar graphs. 4 - Martin S. Krejca, Carsten Witt:
A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive. 5 - Haitao Wang, Yiming Zhao:
Computing the Minimum Bottleneck Moving Spanning Tree. 6 - Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith:
Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. 7 - Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. 8 - Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif:
Combining Crown Structures for Vulnerability Measures. 9 - Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Model Checking on Graphs of Bounded Treedepth. 10 - Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt:
Recognition Complexity of Subgraphs of bf k-Connected Planar Cubic Graphs. 11
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-12 01:24 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:
