default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th WALCOM 2024: Kanazawa, Japan
- Ryuhei Uehara
, Katsuhisa Yamanaka, Hsu-Chun Yen:
WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings. Lecture Notes in Computer Science 14549, Springer 2024, ISBN 978-981-97-0565-8 - Shin-ichi Minato:
Recent Research Activities on Algorithmic Foundations for Social Advancement. 1-8 - Naomi Nishimura:
Reasons to Fall (More) in Love with Combinatorial Reconfiguration. 9-14 - Csaba D. Tóth:
Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle. 15-31 - Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista:
Quantum Graph Drawing. 32-46 - Julia Katheder, Stephen G. Kobourov, Axel Kuckuk, Maximilian Pfister, Johannes Zink:
Simultaneous Drawing of Layered Trees. 47-61 - T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue:
Fully Dynamic Algorithms for Euclidean Steiner Tree. 62-75 - N. R. Aravind, Roopam Saxena:
The Parameterized Complexity of Terminal Monitoring Set. 76-90 - Dennis Wong, Bowie Liu, Chan-Tong Lam, Marcus Im:
Generating Cyclic 2-Gray Codes for Fibonacci q-Decreasing Words. 91-102 - Arturo Merino, Namrata, Aaron Williams:
On the Hardness of Gray Code Problems for Combinatorial Objects. 103-117 - Fahad Panolan, Hannane Yaghoubizade:
On MAX-SAT with Cardinality Constraint. 118-133 - Thomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms:
Minimizing Corners in Colored Rectilinear Grids. 134-148 - Carolina Haase, Philipp Kindermann:
On Layered Area-Proportional Rectangle Contact Representations. 149-162 - Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
Short Flip Sequences to Untangle Segments in the Plane. 163-178 - Jingyang Zhao, Mingyu Xiao:
Improved Approximation Algorithms for Cycle and Path Packings. 179-193 - Ruoying Li, Sabine Storandt:
Exact and Approximate Hierarchical Hub Labeling. 194-211 - Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura:
Reconfiguration of Multisets with Applications to Bin Packing. 212-226 - Naoki Domon, Akira Suzuki, Yuma Tamura, Xiao Zhou:
The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules. 227-241 - Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub, Ryuhei Uehara:
Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. 242-256 - Gordon Hoi, Sanjay Jain, Ammar Fathin Sabili, Frank Stephan:
A Bisection Approach to Subcubic Maximum Induced Matching. 257-272 - Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma:
Stable and Dynamic Minimum Cuts. 273-287 - Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal:
Black Hole Search in Dynamic Cactus Graph. 288-303 - Deniz Agaoglu Çagirici, Peter Zeman:
Recognition and Isomorphism of Proper $\boldsymbol{H}$-Graphs for Unicyclic $\boldsymbol{H}$ in FPT-Time. 304-318 - Oleg Verbitsky, Maksim Zhukovskii:
Canonization of a Random Circulant Graph by Counting Walks. 319-334 - Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica:
Counting Vanishing Matrix-Vector Products. 335-349 - Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. 350-364 - Shin-Ichi Nakano:
(t, s)-Completely Independent Spanning Trees. 365-376 - Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi:
Orientable Burning Number of Graphs. 377-391 - Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi:
Dichotomies for Tree Minor Containment with Structural Parameters. 392-405 - Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi:
Structural Parameterizations of Vertex Integrity. 406-420 - Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou:
On the Complexity of List H-Packing for Sparse Graph Classes. 421-435
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-09-02 00:55 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
