Christoph Dürr

Georgii Melidi

CoRR, January, 2025

Randomized Binary and Tree Search Under Pressure.

[BibT_eX]

[DOI]

Agustín Caracci

José Verschae

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Scenario-Based Robust Optimization of Tree Structures.

[BibT_eX]

[DOI]

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds.

[BibT_eX]

[DOI]

CoRR, 2024

Overcoming Brittleness in Pareto-Optimal Learning Augmented Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Contract Scheduling with Distributional and Multiple Advice.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023

Best-of-Both-Worlds Analysis of Online Search.

[BibT_eX]

[DOI]

Shendan Jin

Algorithmica, December, 2023

On price-induced minmax matchings.

[BibT_eX]

[DOI]

Mathieu Mari

Ulrike Schmidt-Kraepelin

CoRR, 2023

2021

New results on multi-level aggregation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Randomized two-valued bounded delay online buffer management.

[BibT_eX]

[DOI]

Shahin Kamali

Oper. Res. Lett., 2021

Online Primal-Dual Algorithms with Predictions for Packing Problems.

[BibT_eX]

[DOI]

CoRR, 2021

Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty.

[BibT_eX]

[DOI]

Evripidis Bampis

Thomas Erlebach

Murilo Santos de Lima

Nicole Megow

Jens Schlöter

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Online Algorithms for Multilevel Aggregation.

[BibT_eX]

[DOI]

Oper. Res., 2020

Scheduling with a processing time oracle.

[BibT_eX]

[DOI]

CoRR, 2020

An Adversarial Model for Scheduling with Testing.

[BibT_eX]

[DOI]

Algorithmica, 2020

Online Clique Clustering.

[BibT_eX]

[DOI]

Algorithmica, 2020

Online Computation with Untrusted Advice.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Non-monotone DR-submodular Maximization over General Convex Sets.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019

Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees.

[BibT_eX]

[DOI]

CoRR, 2019

Best-Of-Two-Worlds Analysis of Online Search.

[BibT_eX]

[DOI]

Shendan Jin

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018

The triangle scheduling problem.

[BibT_eX]

[DOI]

J. Sched., 2018

Preface of STACS 2016 Special Issue.

[BibT_eX]

[DOI]

Heribert Vollmer

Theory Comput. Syst., 2018

Online Maximum Matching with Recourse.

[BibT_eX]

[DOI]

Shendan Jin

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Scheduling with Explorable Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017

Infinite linear programming and online searching with turn cost.

[BibT_eX]

[DOI]

Diogo Arsénio

Theor. Comput. Sci., 2017

The local-global conjecture for scheduling with non-linear cost.

[BibT_eX]

[DOI]

J. Sched., 2017

Multi-processor Search and Scheduling Problems with Setup Cost.

[BibT_eX]

[DOI]

Diogo Arsénio

Alejandro López-Ortiz

Theory Comput. Syst., 2017

2016

The triangle scheduling problem.

[BibT_eX]

[DOI]

CoRR, 2016

The Expanding Search Ratio of a Graph.

[BibT_eX]

[DOI]

Thomas Lidbetter

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

On the Power of Advice and Randomization for Online Bipartite Matching.

[BibT_eX]

[DOI]

Odile Bellenguez-Morineau

Christian Konrad

Marc P. Renault

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Online Algorithms for Multi-Level Aggregation.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines.

[BibT_eX]

[DOI]

Damien Prot

J. Sched., 2015

Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption.

[BibT_eX]

[DOI]

Lukasz Jez

Oscar C. Vásquez

Discret. Appl. Math., 2015

Online Bin Packing with Advice of Small Size.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Competitive Strategies for Online Clique Clustering.

[BibT_eX]

[DOI]

Bengt J. Nilsson

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014

Preface of STACS 2012 Special Issue.

[BibT_eX]

[DOI]

Thomas Wilke

Theory Comput. Syst., 2014

Approximation Algorithms for Clique Clustering.

[BibT_eX]

[DOI]

Bengt J. Nilsson

CoRR, 2014

Order constraints for single machine scheduling with non-linear cost.

[BibT_eX]

[DOI]

Óscar C. Vásquez

Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013

A <i>ϕ</i>-competitive algorithm for collecting items with increasing weights from a dynamic queue.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Preface of Special Issue on Theoretical Aspects of Computer Science.

[BibT_eX]

[DOI]

Thomas Schwentick

Theory Comput. Syst., 2013

The Wide Partition Conjecture and the Atom Problem in Discrete Tomography.

[BibT_eX]

[DOI]

Flavio Guiñez

Electron. Notes Discret. Math., 2013

Mechanism Design for Aggregating Energy Consumption and Quality of Service in Speed Scaling Scheduling.

[BibT_eX]

[DOI]

Lukasz Jez

Óscar C. Vásquez

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012

Speed scaling with power down scheduling for agreeable deadlines.

[BibT_eX]

[DOI]

Sustain. Comput. Informatics Syst., 2012

Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography.

[BibT_eX]

[DOI]

Flavio Guiñez

Martín Matamala

SIAM J. Discret. Math., 2012

The interval ordering problem.

[BibT_eX]

[DOI]

Maurice Queyranne

Frits C. R. Spieksma

Fabrice Talla Nobibon

Gerhard J. Woeginger

Discret. Appl. Math., 2012

Tile-Packing Tomography Is NP-hard.

[BibT_eX]

[DOI]

Algorithmica, 2012

Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games.

[BibT_eX]

[DOI]

Johanne Cohen

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Approximating the Throughput by Coolest First Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents.

[BibT_eX]

[DOI]

Thomas Wilke

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2011

Non-clairvoyant Scheduling Games.

[BibT_eX]

[DOI]

Johanne Cohen

Theory Comput. Syst., 2011

Frontmatter, Table of Contents, Preface, Conference Organization.

[BibT_eX]

[DOI]

Thomas Schwentick

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010

Polynomial Time Algorithms for Minimum Energy Scheduling.

[BibT_eX]

[DOI]

Philippe Baptiste

Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

Tile-Packing Tomography Is \mathbb<i>NP</i>{\mathbb{NP}}-hard.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

Online Scheduling of Bounded Length Jobs to Maximize Throughput.

[BibT_eX]

[DOI]

Lukasz Jez

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Collecting weighted items from a dynamic queue.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Non-clairvoyant Scheduling Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard.

[BibT_eX]

[DOI]

Flavio Guiñez

Martín Matamala

Proceedings of the Algorithms, 2009

2008

Runway sequencing with holding patterns.

[BibT_eX]

[DOI]

Konstantin Artiouchine

Philippe Baptiste

Eur. J. Oper. Res., 2008

Generalized Whac-a-Mole

[BibT_eX]

[DOI]

CoRR, 2008

Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

The complexity of mean flow time scheduling problems with release times.

[BibT_eX]

[DOI]

Svetlana A. Kravchenko

Francis Sourd

J. Sched., 2007

Nash Equilibria in Voronoi Games on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

2006

A Note on Scheduling Equal-Length Jobs to Maximize Throughput.

[BibT_eX]

[DOI]

J. Sched., 2006

Competitive Analysis of Scheduling Algorithms for Aggregated Links.

[BibT_eX]

[DOI]

Wojciech Jawor

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Finding Total Unimodularity in Optimization Problems Solved by Linear Programs.

[BibT_eX]

[DOI]

Mathilde Hurand

Proceedings of the Algorithms, 2006

Tomographie discrète, calcul quantique et ordonnancement. (Discrete tomography, quantum computation and scheduling).

[BibT_eX]

[DOI]

, 2006

2004

Cellular automata and communication complexity.

[BibT_eX]

[DOI]

Ivan Rapaport

Guillaume Theyssier

Theor. Comput. Sci., 2004

Preemptive scheduling of equal-length jobs to maximize weighted throughput.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time

[BibT_eX]

[DOI]

CoRR, 2004

Quantum Query Complexity of Some Graph Problems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Tiling with bars under tomographic constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

On tiling under tomographic constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2001

A Note on Tiling under Tomographic Constraints

[BibT_eX]

[DOI]

CoRR, 2001

Quantum Algorithms for Element Distinctness.

[BibT_eX]

[DOI]

Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001

1999

Reconstructing hv-Convex Polyominoes from Orthogonal Projections.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

1998

Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1996

A Quantum Algorithm for Finding the Minimum

[BibT_eX]

[DOI]

Peter Høyer

CoRR, 1996

A Decision Procedure for Well-Formed Linear Quantum Cellular Automata.

[BibT_eX]

[DOI]

Huong Lê Thanh

Miklos Santha

Proceedings of the STACS 96, 1996

A Decision Procedure for Unitary Linear Quantum Cellular Automata.

[BibT_eX]

[DOI]