default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th WALCOM 2026: Perugia, Italy
- Emilio Di Giacomo
, Debajyoti Mondal:
WALCOM: Algorithms and Computation - 20th International Conference and Workshops on Algorithms and Computation, WALCOM 2026, Perugia, Italy, March 4-6, 2026, Proceedings. Lecture Notes in Computer Science 16444, Springer 2026, ISBN 978-981-95-7126-0
Graph Drawings and Embeddings
- Markus Chimani, Mirko H. Wagner:
Computing Beyond-Planar Crossing Numbers via Forbidden Crossing Patterns. 3-18 - Oswin Aichholzer, Yuya Higashikawa, Joachim Orthaber, Daniel Perz, Birgit Vogtenhuber, Alexandra Weinberger:
Minimum-Weight Outerplane Laman Graphs. 19-32 - Steven van den Broek, Marc J. van Kreveld, Wouter Meulemans, Arjen Simons:
Minimizing Vertical Length in Linked Bar Charts. 33-48 - Henry Förster, Giacomo Ortali, Lena Schlipf:
On Compaction and Realizability of Almost Convex Octilinear Representations. 49-63 - Maike Buchin, Wolf Kißler, Fabian Kubon:
Hardness and Parameterized Tractability of the Weak Graph Distance. 64-78
Approximation
- Siam Habib, Debajyoti Mondal, Sadia Sharmin, Md. Saidur Rahman:
Hardness and Approximation Results for Extending Unique Neighborhood Networks. 81-95 - Michal Szyfelbein:
Approximating the Average-Case Graph Search Problem with Non-uniform Costs. 96-109 - David Denisov, Shlomi Dolev, Dan Feldman, Michael Segal:
Linear Time Small Coresets for k-Mean Clustering of Segments with Applications. 110-124 - Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq:
Cartesian Forest Matching. 125-139 - Markus Lohrey, Leon Rische, Louisa Seelbach Benkner, Julio Xochitemol:
Streaming Algorithms for Products of Probabilities. 140-153
Induced subgraphs and dominating sets
- Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden:
Finding Order-Preserving Subgraphs. 157-171 - Tesshu Hanaka, Yuto Okada, Yota Otachi, Lena Volk:
Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited. 172-186 - Marco D'Elia, Fabrizio Frati:
Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs. 187-202 - Urszula Bednarz, Jan Kratochvíl, Adrian Michalski:
Complexity of Perfect (1, 2)-Dominating Sets in Low-Degree Graphs. 203-214
Complexity
- Lisa Lehner, Christian Komusiewicz, Luca Pascal Staus:
A Complexity Analysis of the c-Closed Vertex Deletion Problem. 217-231 - Cristina Bazgan, Morgan Chopin, André Nichterlein, Camille Richer:
On the Computational Complexity of Covering Multi-Interface Networks. 232-246 - Jan Bok, Avinandan Das, Anna Gujgiczer, Nikola Jedlicková:
Generalizing Brooks' Theorem via Partial Coloring Is Hard Classically and Locally. 247-262 - Sheikh Shakil Akhtar, Pranabendu Misra, Geevarghese Philip:
Space Efficient Algorithms for Parameterised Problems. 263-275 - Malory Marin:
Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets. 276-290
Games and Graph Reconfiguration
- Kyle Burke, Antoine Dailly, Nacim Oijid:
Complexity and Algorithms for Arc-Kayles and Non-disconnecting Arc-Kayles. 293-307 - Pragya Arora, Palash Dey, Neeldhara Misra:
Can One Flip Spoil it All? 308-322 - Naonori Kakimura, Yoshihiko Terai:
Computing Power Indices in Weighted Majority Games with Formal Power Series. 323-336 - Henning Fernau, Kevin Mann:
How to Reconfigure Your Alliances. 337-352 - Julien Bensmail, Noémie Catherinot, Foivos Fioravantes, Clara Marcille, Nacim Oijid:
Graph Irregularity via Edge Deletions. 353-367
Shortest Paths and Minimum Spanning Trees
- Tatsuya Gima, Yasuaki Kobayashi, Yota Otachi, Takumi Sato:
Forcing a Unique Minimum Spanning Tree and a Unique Shortest Path. 371-385 - Afrouz Jabal Ameli, Faezeh Motiei, Morteza Saghafian:
On the MST-Ratio: Theoretical Bounds and Complexity of Finding the Maximum. 386-401 - Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma:
Disjoint Tours and the Price of Diversity. 402-417 - Taekang Eom, Taehoon Ahn, Minju Song, Hee-Kap Ahn:
Shortcutting the Diameter of a Polygon. 418-431 - Rin Saito, Takehiro Ito:
Parameterized Complexity of Reconfiguring Vertex-Disjoint Shortest Paths. 432-447
Geometric Problems
- Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono, Alexander Wolff:
Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion. 451-466 - Kevin Buchin, Maike Buchin, Jan Erik Swiadek, Sampson Wong:
Fundamentals of Computing Continuous Dynamic Time Warping in 2D Under Different Norms. 467-482 - Esther M. Arkin, Alon Efrat, Omrit Filtser, Stephen G. Kobourov, Jan Kratochvíl, Joseph S. B. Mitchell, Ariel Rosenberg:
The Gate-Cover Problem. 483-498 - Mohammad Ali Abam, Mohammad Ghodsi, Seyed Mohammad Hussein Kazemi:
Trajectory Visibility at First Sight. 499-511 - Jonas Friemel, David Liedtke, Christian Scheffer:
Tile Reconfiguration by a Finite Automaton. 512-526
Enumeration Problems
- Ryohei Okuda, Jun Kawahara, Shin-ichi Minato:
Enumerating All Graph Colorings Using Zero-Suppressed Binary Decision Diagrams. 529-544 - Marco D'Elia, Irene Finocchi, Maurizio Patrignani:
Engineering Algorithms for ℓ-Isolated Maximal Clique Enumeration. 545-559 - Kazuhiro Kurita, Kevin Mann:
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs. 560-575 - Yuki Nishimura, Kazuya Haraguchi:
Enumeration of Bases in Matroid with Exponentially Large Ground Set. 576-590
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 2026-03-13 21:25 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:
