default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID37th IWOCA 2026: Clermont-Ferrand, France
- Florent Foucaud
, Aline Parreau:
Combinatorial Algorithms - 37th International Workshop, IWOCA 2026, Clermont-Ferrand, France, June 8-11, 2026, Proceedings. Lecture Notes in Computer Science 16587, Springer 2026, ISBN 978-3-032-27731-2 - Faisal N. Abu-Khzam, Dipayan Chakraborty, Lucas Isenmann, Nacim Oijid:
On the Complexity of Vertex-Splitting into an Interval Graph. 1-15 - Rajat Adak, Pragya Verma:
Bounds on Linear Turán Number for Trees. 16-31 - Sheikh Shakil Akhtar, Geevarghese Philip:
Exact Algorithms for Edge Deletion to Cactus. 32-44 - Aflatoun Amouzandeh, Klaus Jansen, Lis Pirotton, Rob van Stee, Corinna Wambsganz:
Minimizing the Weighted Makespan with Restarts on a Single Machine. 45-59 - Dhanyamol Antony, L. Sunil Chandran, Dalu Jacob, R. B. Sandeep:
Parameterized Algorithms for k-Inversion. 60-72 - Júlio Araújo, Samuel N. Araújo, Pedro P. Medeiros, Nicolas Nisse, Caroline Aparecida de Paula Silva:
On the Rank and the General Position Number in Cycle Convexity. 73-87 - Deepak M. Bakal, Y. M. Borse:
Hardness Results on Bondage and Reinforcement Problems in Chordal Graphs. 88-102 - Amotz Bar-Noy, Igor Kalinichev, David Peleg, Dror Rawitz:
Degree Realization with Maximum Matching. 103-117 - Iain Beaton, Ben Cameron:
Vertex-Critical Graphs in Subfamilies of (P4+ℓ P1)-Free Graphs. 118-130 - Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler:
Breadth-First Search Trees with Many or Few Leaves. 131-145 - Hans L. Bodlaender, Maher Mallem:
The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth. 146-160 - Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, André Nichterlein, Camille Richer:
Parameterized Algorithms for Computing MAD Trees. 161-174 - Sobyasachi Chatterjee, Sushmita Gupta, Saket Saurabh, Sanjay Seetharaman, Anannya Upasana:
Dominating Set with Quotas: Balancing Coverage and Constraints. 175-189 - Neelabjo Shubhashis Choudhury, Chetan Gupta, Raghunath Tewari:
Reachability in Graphs with Polynomially Many Surface Non-separating Cycles is in UL. 190-203 - Lapo Cioni, Andrea Marino, Jason Schoeters, Takeaki Uno:
Enumerating Spanners in Directed Temporal Graphs. 204-219 - Andrea D'Ascenzo, Giuseppe F. Italiano, Sotiris Kanellopoulos, Anna Mpanti, Aris Pagourtzis, Christos Pergaminelis:
Beer Path Problems in Temporal Graphs. 220-235 - Soura Sena Das, Tuomo Lehtilä, Sagnik Sen:
On $(1,\le l)$-Locating-Dominating Codes in Infinite Triangular Grid. 236-250 - Thomas Depian, Carolina Haase, Martin Nöllenburg, André Schulz:
Realizing Planar Linkages in Polygonal Domains. 251-265 - Stefan Dobrev, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende:
Online Drone Coverage of Targets on a Line. 266-280 - Christoph Dürr, Arturo Merino, José A. Soto, José Verschae:
Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds. 281-295 - Dimitris Fotakis, Laurent Gourvès, Aris Pagourtzis, Panagiotis Patsilinakos:
Removable Online Knapsack: Exploiting Recourse and Bounded Item Sizes. 296-310 - Samuel German:
Layer-Based Width for PAFP on DAGs: A BFS-Width-2 Normal Form and Exact-Length Width-2 Tractability. 311-326 - Anni Hakanen, P. D. Pavan:
Solid-Resolving Sets on Directed Graphs. 327-340 - Shunsuke Hamada, Yuto Okada, Hirotaka Ono, Yota Otachi:
Minimum Clique Bicoloring. 341-355 - Frédéric Havet, Clément Rambaud, Caroline Aparecida de Paula Silva:
On the $(\le p)$-Inversion Diameter of Oriented Graphs. 356-369 - Klaus Jansen, Tobias Mömke, Björn Schumacher:
Hardness of SetCover Reoptimization. 370-384 - Subrahmanyam Kalyanasundaram, Subodh Kumar:
Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts. 385-399 - Hitendra Kumar, Kumud Singh Porte, R. B. Sandeep:
Tight Upper Bounds on Color Reversal by Local Inversions. 400-414 - Ioannis Lamprou, Nikolaos Lazaropoulos, Ioannis Sigalas, Ioannis Vaxevanakis, Vassilis Zissimopoulos:
Domination and Coverage Problems Under Vulnerability Constraints. 415-429 - Adiesha Liyanage, Brendan Mumey, Braeden Sopp:
Fast Order Statistics with Group Inequality Testing. 430-441 - Clara Marcille, Nacim Oijid:
An Algorithm for Monitoring Edge-Geodetic Sets in Chordal Graphs. 442-455 - Beatriz Martins, Nicolas Trotignon:
(Even Hole, Triangle)-Free Graphs Revisited. 456-469 - Lucia Moura, Prangya Parida, Brett Stevens, Aaron Williams:
One Sequence to Rule Them All: 풪(1)-Time Parallel Generation of Mixed-Radix Gray Codes. 470-485 - Sangam Balchandar Reddy:
On the Complexity of Signed Domination. 486-499 - Ankit Sharma, Kaustav Paul, Arti Pandey:
Improved Bounds on Proper Conflict-Free Coloring of Graphs. 500-514 - Gustavo Zambonin, Larissa Gremelmaier Rosa, Ricardo Custódio, Daniel Panario:
Cryptographic Applications of Combinatorial Ranking for Integer Compositions. 515-530 - Bin Fu, Yumei Huo, Hairong Zhao:
Minimizing Makespan in Sublinear Time via Weighted Random Sampling. 531-545
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-06-20 00:07 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:
