default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th CIAC 2025: Rome, Italy - Part I
- Irene Finocchi, Loukas Georgiadis:
Algorithms and Complexity - 14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025, Proceedings, Part I. Lecture Notes in Computer Science 15679, Springer 2025, ISBN 978-3-031-92931-1 - Klaus Jansen
, Kai Kahler, Esther Zwanger:
Exact and Approximate High-Multiplicity Scheduling on Identical Machines. 1-17 - Piotr Wojciechowski, K. Subramani:
Unit Refutations in Horn Constraint Systems. 18-33 - Nader H. Bshouty:
On Exact Learning of d-Monotone Functions. 34-50 - David L. Fairbairn, George B. Mertzios, Norbert Peyerimhoff:
Computational Complexity of Combinatorial Distance Matrix Realisation. 51-67 - Paz Carmi, Matthew J. Katz, Idan Tomer:
Online Range Assignment Problems. 68-82 - Adrian Dumitrescu:
General Position Subset Selection in Line Arrangements. 83-90 - Suryajith Chillara, Nithish Raja:
Branching Programs with Extended Memory: New Insights. 91-104 - Suthee Ruangwises:
Tatami Printer: Physical ZKPs for Tatami Puzzles. 105-118 - Daniel Schmand, Torben Schürenberg, Martin Strehler:
On the Price of Anarchy in Packet Routing Games with FIFO. 119-135 - Cristina Bazgan, Morgan Chopin, André Nichterlein, Camille Richer:
On the Computational Complexity of Graph Reconstruction. 136-152 - Vincenzo Bonifaci, Sara Galatro:
Efficient Certifying Algorithms for Linear Classification. 153-169 - Anup Bhattacharya, Pinki Pradhan:
Improved Sublinear-Time Moment Estimation Using Weighted Sampling. 170-186 - Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale:
Structural Parameterization of Locating-Dominating Set and Test Cover. 187-204 - Annalisa De Bonis:
Improved Bounds for Group Testing in Arbitrary Hypergraphs. 205-221 - Václav Blazej, Satyabrata Jana, Peter Strulo:
A Parameterized Perspective of All-Colors. 222-239 - Leonidas Palios:
On the Discrete and Semi-continuous Versions of the Two-Watchtower Problem in the Plane. 240-257 - Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Degree Realization by Bipartite Cactus Graphs. 258-275 - Omrit Filtser, Kien C. Huynh, Anastasia Lemetti, Joseph S. B. Mitchell, Tatiana Polishchuk, Valentin Polishchuk:
On Two Simple[st] Learning Tasks. 276-291 - Ioana O. Bercea, Guy Even, Tomer Even, Gabriel Marques Domingues:
Dynamic Filter and Retrieval with One Access to Modifiable Memory. 292-309 - Paloma T. Lima, Amir Nikabadi:
Longest Path Transversals in Claw-Free and P5-Free Graphs. 310-325 - Vítor Gomes Chagas, Samuel Plaça de Paula, Greis Yvet Oropeza Quesquén, Lucas de Oliveira Silva, Uéverton dos Santos Souza:
Realizing Graphs with Cut Constraints. 326-342 - Bruce M. Kapron, Koosha Samieefar:
On The Computational Complexity of Games with Uncertainty. 343-360
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-03 00:06 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.
