default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWOCA 2024: Ischia, Italy
- Adele Anna Rescigno
, Ugo Vaccaro:
Combinatorial Algorithms - 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1-3, 2024, Proceedings. Lecture Notes in Computer Science 14764, Springer 2024, ISBN 978-3-031-63020-0 - Max A. Alekseyev:
On Computing Sets of Integers with Maximum Number of Pairs Summing to Powers of 2. 1-13 - Jirí Fink, Torsten Mütze:
Matchings in Hypercubes Extend to Long Cycles. 14-27 - Konstantinos Georgiou, Xin Wang:
Weighted Group Search on the Disk and Improved LP-Based Lower Bounds for Priority Evacuation. 28-42 - Stoyan Dimitrov:
Simple Random Sampling of Binary Forests with Fixed Number of Nodes and Trees. 43-54 - Ylène Aboulfath, Dimitri Watel, Marc-Antoine Weisser, Thierry Mautor, Dominique Barth:
Maximizing Minimum Cycle Bases Intersection. 55-68 - Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic:
Improving Online Bin Covering with Little Advice. 69-81 - Julien Bensmail, Pierre-Marie Marcille:
An Improved Bound for Equitable Proper Labellings. 82-97 - Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate Realizations for Outerplanaric Degree Sequences. 98-110 - Valentin Bartier, Oscar Defrain, Fionn Mc Inerney:
Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension. 111-125 - Todor Antic, Jelena Glisic, Milan Milivojcevic:
Star-Forest Decompositions of Complete Graphs. 126-137 - Todor Antic:
Convex-Geometric k-Planar Graphs Are Convex-Geometric (k+1)-Quasiplanar. 138-150 - Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon:
Detecting K2,3 as an Induced Minor. 151-164 - Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Maximal Palindromes in Non-standard Matching Models. 165-179 - Nikola Jedlicková, Jan Kratochvíl:
On the Structure of Hamiltonian Graphs with Small Independence Number. 180-192 - Daniel J. Harvey, Jesper Jansson, Mikolaj Marciniak, Yukihiro Murakami:
Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems. 193-205 - Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. 206-217 - Fernanda Couto, Luís Felipe I. Cunha, Edmundo Pinto, Daniel Posner:
Minimizing Distances Between Vertices and Edges Through Tree t-Spanners. 218-231 - Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono:
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. 232-246 - Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos:
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional. 247-258 - Tong-Nong Lin, Yu-Cheng Lin, Cheng-Chen Tsai, Meng-Tsung Tsai, Shih-Yu Tsai:
Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers. 259-272 - Gianlorenzo D'Angelo, Esmaeil Delfaraz:
Approximation Algorithms for Node-Weighted Directed Steiner Problems. 273-286 - Jan Bok, Antoine Dailly, Tuomo Lehtilä:
Resolving Sets in Temporal Graphs. 287-300 - Melvin Adekanye, Christopher Bury, Ben Cameron, Thaler Knodel:
On the Finiteness of k-Vertex-Critical 2P2-Free Graphs with Forbidden Induced Squids or Bulls. 301-313 - Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir:
Directed Path Partition Problem on Directed Acyclic Graphs. 314-326 - Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige:
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. 327-340 - Svein Høgemo:
Lower Bounds for Leaf Rank of Leaf Powers. 341-353 - Kevin Mann, Henning Fernau:
Perfect Roman Domination: Aspects of Enumeration and Parameterization. 354-368 - Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. 369-381 - Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci:
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. 382-395 - Jared Coleman, Dmitry Ivanov, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce:
Linear Search for an Escaping Target with Unknown Speed. 396-407 - Waseem Akram, Sanjeev Saxena:
Dominance for Enclosure Problems. 408-420 - Babak Ghanbari, Robert Sámal:
Approximate Cycle Double Cover. 421-432 - Stefan Hougardy, Bart Zondervan:
The Bottom-Left Algorithm for the Strip Packing Problem. 433-445 - Stefan Funke, Sabine Storandt:
Parameterized Upper Bounds for Path-Consistent Hub Labeling. 446-459 - Vadim V. Lozin:
The Hamiltonian Cycle Problem and Monotone Classes. 460-471 - Paola Flocchini, Debasish Pattanayak, Nicola Santoro, Masafumi Yamashita:
The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots. 472-484 - Akash Ambashankar, Hovhannes A. Harutyunyan:
Broadcasting in Stars of Cliques. 485-496 - Petr Kolman:
Approximating Spanning Tree Congestion on Graphs with Polylog Degree. 497-508 - Nikolas Alexander Schwarz, Sabine Storandt:
Efficient Computation of Crossing Components and Shortcut Hulls. 509-522 - Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma:
Parameterized Complexity of Paired Domination. 523-536
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-08-28 01:15 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.
