default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th WALCOM 2023: Hsinchu, Taiwan
- Chun-Cheng Lin
, Bertrand M. T. Lin, Giuseppe Liotta:
WALCOM: Algorithms and Computation - 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023, Proceedings. Lecture Notes in Computer Science 13973, Springer 2023, ISBN 978-3-031-27050-5
Invited Talks
- Jan Kratochvíl:
Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult. 3-11 - Michael Kaufmann:
The Family of Fan-Planar Graphs. 12-19
Computational Geometry
- Stephane Durocher, J. Mark Keil, Debajyoti Mondal:
Minimum Ply Covering of Points with Unit Squares. 23-35 - Takumi Shiota, Toshiki Saitoh:
Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms. 36-48 - Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, Birgit Vogtenhuber:
Flipping Plane Spanning Paths. 49-60 - Tetsuya Araki, Shin-Ichi Nakano:
Away from Each Other. 61-70 - A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees. 71-77 - Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi:
Reflective Guarding a Gallery. 78-89 - Prashant Gokhale, J. Mark Keil, Debajyoti Mondal:
Improved and Generalized Algorithms for Burning a Planar Point Set. 90-101 - Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
On the Longest Flip Sequence to Untangle Segments in the Plane. 102-112
String Algorithm
- Koshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Inferring Strings from Position Heaps in Linear Time. 115-126 - Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Internal Longest Palindrome Queries in Optimal Time. 127-138 - Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba:
Finding the Cyclic Covers of a String. 139-150 - Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka:
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs. 151-163
Optimization
- Huong Luu, Marek Chrobak:
Better Hardness Results for the Minimum Spanning Tree Congestion Problem. 167-178 - Varunkumar Jayapaul, Seungbum Jo, Krishna V. Palem, Srinivasa Rao Satti:
Energy Efficient Sorting, Selection and Searching. 179-190 - Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara:
Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs. 191-201 - Bengt J. Nilsson, Christiane Schmidt:
k-Transmitter Watchman Routes. 202-213
Graph Algorithm
- Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu:
Splitting Plane Graphs to Outerplanarity. 217-228 - Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis:
Certifying Induced Subgraphs in Large Graphs. 229-241 - Kaustav Paul, Arti Pandey:
Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs. 242-253 - Duc A. Hoang:
On the Complexity of Distance-d Independent Set Reconfiguration. 254-266 - Angelo Monti, Blerina Sinaimeri:
On Star-Multi-interval Pairwise Compatibility Graphs. 267-278 - Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration. 279-290 - N. R. Aravind, Roopam Saxena:
Parameterized Complexity of Path Set Packing. 291-302
Approximation Algorithm
- Baruch Schieber, Bhargav Samineni, Soroush Vahidi:
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput. 305-316 - Ildikó Schlotter:
Recognizing When a Preference System is Close to Admitting a Master List. 317-329 - Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Groups Burning: Analyzing Spreading Processes in Community-Based Networks. 330-342 - A. Mohanapriya, P. Renjith, N. Sadagopan:
Roman k-Domination: Hardness, Approximation and Parameterized Results. 343-355
Parameterized Complexity
- Ameet Gadekar:
On the Parameterized Complexity of Compact Set Packing. 359-370 - Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos:
Structural Parameterization of Cluster Deletion. 371-383 - Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette:
Parity Permutation Pattern Matching. 384-395
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-10-22 02:23 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
