


default search action
IWOCA 2023: Tainan, Taiwan
- Sun-Yuan Hsieh

, Ling-Ju Hung
, Chia-Wei Lee
:
Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings. Lecture Notes in Computer Science 13889, Springer 2023, ISBN 978-3-031-34346-9 - Abu Reyan Ahmed, Keaton Hamm, Stephen G. Kobourov, Mohammad Javad Latifi Jebelli, Faryad Darabi Sahneh, Richard Spence:

Multi-priority Graph Sparsification. 1-12 - Waseem Akram

, Sanjeev Saxena
:
Point Enclosure Problem for Homothetic Polygons. 13-24 - Virginia Ardévol Martínez

, Romeo Rizzi
, Florian Sikora
:
Hardness of Balanced Mobiles. 25-35 - Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma:

Burn and Win. 36-48 - Imad Assayakh

, Imed Kacem
, Giorgio Lucarelli
:
Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness. 49-61 - Niklas Berndt

, Henri Lotze
:
Advice Complexity Bounds for Online Delayed ℱ-Node-, H-Node- and H-Edge-Deletion Problems. 62-73 - Sriram Bhyravarapu

, Satyabrata Jana
, Lawqueen Kanesh, Saket Saurabh, Shaily Verma:
Parameterized Algorithms for Eccentricity Shortest Path Problem. 74-86 - Andrew Bloch-Hansen, Daniel R. Page

, Roberto Solis-Oba:
A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs. 87-98 - Thomas Bläsius

, Marcus Wilhelm
:
Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks. 99-110 - Cornelius Brand, Martin Koutecký, Alexandra Lassota:

A Polyhedral Perspective on Tropical Convolutions. 111-122 - Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker

, David Wehner:
Online Knapsack with Removal and Recourse. 123-135 - Toni Böhnlein, Niccolò Di Marco

, Andrea Frosini:
Minimum Surgical Probing with Convexity Constraints. 136-147 - Dipayan Chakraborty

, Soumen Nandi
, Sagnik Sen, D. K. Supraja:
A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter. 148-159 - Markus Chimani

, Max Ilsen
:
Capacity-Preserving Subgraphs of Directed Flow Networks. 160-172 - Riccardo Dondi, Alexandru Popa:

Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms. 173-184 - Adrian Dumitrescu, Andrzej Lingas:

Finding Small Complete Subgraphs Efficiently. 185-196 - Adrian Dumitrescu, Csaba D. Tóth:

Maximal Distortion of Geodesic Diameters in Polygonal Domains. 197-208 - Loukas Georgiadis

, Dionysios Kefallinos, Evangelos Kosinas:
On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems. 209-220 - Tim A. Hartmann

, Komal Muluk
:
Make a Graph Singly Connected by Edge Orientations. 221-232 - Ran Hu, Divy H. Kanani, Jingru Zhang:

Computing the Center of Uncertain Points on Cactus Graphs. 233-245 - Kusum, Arti Pandey:

Cosecure Domination: Hardness Results and Algorithms. 246-258 - Girija Limaye

, Meghana Nasre:
Optimal Cost-Based Allocations Under Two-Sided Preferences. 259-270 - Bowie Liu

, Dennis Wong:
Generating Cyclic Rotation Gray Codes for Stamp Foldings and Semi-meanders. 271-281 - Isnard Lopes Costa, Raul Lopes, Andrea Marino, Ana Silva:

On Computing Large Temporal (Unilateral) Connected Components. 282-293 - Sven Mallach

:
On Integer Linear Programs for Treewidth Based on Perfect Elimination Orderings. 294-306 - Neeldhara Misra

, Yash More:
Finding Perfect Matching Cuts Faster. 307-318 - Joydeep Mukherjee, Tamojit Saha:

Connected Feedback VertexSet on AT-Free Graphs. 319-330 - Yuta Nozaki

, Kunihiro Wasa
, Katsuhisa Yamanaka
:
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries. 331-342 - Guillaume Sagnol

:
Improved Analysis of Two Algorithms for Min-Weighted Sum Bin Packing. 343-355 - Frank Kammer, Johannes Meintrup, Andrej Sajenko

:
Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism. 356-367 - Takumi Tada, Kazuya Haraguchi

:
A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-Connected Induced Subgraphs. 368-379 - Shaojie Tang

, Jing Yuan
:
Partial-Adaptive Submodular Maximization. 380-391 - Chi-Hao Wang, Chi-Jen Lu, Ming-Tat Ko, Po-An Chen, Chuang-Chieh Lin

:
Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform. 392-403

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














