default search action
IWOCA 2021: Ottawa, ON, Canada
- Paola Flocchini
, Lucia Moura
Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings. Lecture Notes in Computer Science 12757, Springer 2021, ISBN 978-3-030-79986-1
Invited Papers
- Amotz Bar-Noy, Toni Böhnlein, David Peleg, Mor Perry, Dror Rawitz:
Relaxed and Approximate Graph Realizations. 3-19 - Alfred Wassermann
Search for Combinatorial Objects Using Lattice Algorithms - Revisited. 20-33
Contributed Papers
- Nesrine Abbas
Linear Algorithms for Red and Blue Domination in Convex Bipartite Graphs. 37-48 - Bogdan Alecu
Combinatorics and Algorithms for Quasi-chain Graphs. 49-62 - Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Composed Degree-Distance Realizations of Graphs. 63-77 - Sam Barr, Therese Biedl:
All Subgraphs of a Wheel Are 5-Coupled-Choosable. 78-91 - Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy:
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. 92-106 - Benjamin Merlin Bumpus
Edge Exploration of Temporal Graphs. 107-121 - Andrey Bychkov
Optimal Monomial Quadratization for ODE Systems. 122-136 - Ben Cameron, Joe Sawada, Aaron Williams:
A Hamilton Cycle in the k-Sided Pancake Network. 137-151 - Dibyayan Chakraborty
Algorithms and Complexity of s-Club Cluster Vertex Deletion. 152-164 - Jongmin Choi
Covering Convex Polygons by Two Congruent Disks. 165-178 - Ferdinando Cicalese
The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets. 179-193 - Erika Morais Martins Coelho, Hebert Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein:
On the Oriented Coloring of the Disjoint Union of Graphs. 194-207 - Jared Ray Coleman, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce:
The Pony Express Communication Problem. 208-222 - Simon Coumes, Tassadit Bouadi, Lhouari Nourine, Alexandre Termier:
Skyline Groups Are Ideals. An Efficient Algorithm for Enumerating Skyline Groups. 223-236 - Clément Dallard
Vertex Cover at Distance on H-Free Graphs. 237-251 - Peter Damaschke:
On an Ordering Problem in Weighted Hypergraphs. 252-264 - Dariusz Dereniowski
An Efficient Noisy Binary Search in Graphs via Median Approximation. 265-281 - Niccolò Di Marco
A Study on the Existence of Null Labelling for 3-Hypergraphs. 282-294 - Adrian Dumitrescu
Piercing All Translates of a Set of Axis-Parallel Rectangles. 295-309 - Colin Cooper, Martin E. Dyer
A Triangle Process on Regular Graphs. 310-323 - Mathieu Gascon, Riccardo Dondi, Nadia El-Mabrouk:
Complexity and Algorithms for MUL-Tree Pruning. 324-339 - Konstantinos Georgiou, Somnath Kundu, Pawel Pralat:
Makespan Trade-Offs for Visiting Triangle Edges - (Extended Abstract). 340-355 - Toru Hasunuma
Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k. 356-369 - Noah Brüstle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma:
Approximation Algorithms for Hitting Subgraphs. 370-384 - Florian Ingels
Isomorphic Unordered Labeled Trees up to Substitution Ciphering. 385-399 - Byeonguk Kang, Jongmin Choi
Intersecting Disks Using Two Congruent Disks. 400-413 - Walter Kern, Barnaby Martin, Daniël Paulusma
Disjoint Paths and Connected Subgraphs for H-Free Graphs. 414-427 - Soh Kumabe, Takanori Maehara:
Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property. 428-441 - Martin Kucera
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters. 442-455 - Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
Non-preemptive Tree Packing. 456-468 - Yoshifumi Manabe
Card-Based Cryptographic Protocols for Three-Input Functions Using Private Operations. 469-484 - Andrea Marino, Ana Silva
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs. 485-500 - Rahnuma Islam Nishat
Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs. 501-515 - Richard Santiago:
New Approximations and Hardness Results for Submodular Partitioning Problems. 516-530 - N. R. Aravind, Roopam Saxena:
An FPT Algorithm for Matching Cut and d-Cut. 531-543 - Svetlana Topalova
Backtrack Search for Parallelisms of Projective Spaces. 544-557 - Markus Chimani
Approximating Multistage Matching Problems. 558-570 - Michael Wagner, Ludwig Kampel, Dimitris E. Simos:
Heuristically Enhanced IPO Algorithms for Covering Array Generation. 571-586
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 2024-12-05 20:47 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: