Computers are useless. They can only give you answers. — Pablo Picasso



Online Clique Clustering
with Marek Chrobak, Aleksander Fabijan and Bengt Nilsson. Algorithmica, 2019. Preliminary version was presented in Proc. of the 9th International Conference on Algorithms and Complexity, (CIAC) May 2015, under the title "Competitive Strategies for Online Clique Clustering".
[paper, slides, doi]
Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees
with Nguyễn Kim Thắng, Abhinav Srivastav and Léo Tible.
Online Algorithms for Multi-Level Aggregation
with Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Lukáš Folwarczný, Łukasz Jeż, Jiří Sgall, Nguyễn Kim Thắng, Pavel Veselý. Accepted to Operations Research, 2019. Preliminary version was presented in The 24th European Symposium on Algorithms (ESA), August 2016 and in The 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP) june 2015, under the title "Online Multilevel Acknowledgment with Bounded Depth".
[paper, slides]
The expanding search ratio of a graph
with Spyros Angelopoulos and Thomas Lidbetter, Discrete Applied Mathematics, Volume 260, Pages 51-65, May 2019. Preliminary version was presented in The 33rd International Symposium on Theoretical Aspects of Computer Science (STACS), 2016.
[paper, slides]
Best-of-two-worlds analysis of online search
with Spyros Angelopoulos and Shendan Jin. The 36th International Symposium on Theoretical Aspects of Computer Science (STACS), 2019.
[paper, slides]
Online Bin Packing with Advice of Small Size
with Spyros Angelopoulos, Shahin Kamali, Marc Renault and Adi Rosén. Theory of Computing Systems, 1-29, 2018. DOI: 10.1007/s00224-018-9862-5. Preliminary version was presented at The Algorithms and Data Structures Symposium (WADS), august 2015.
[paper, slides]
Online Maximum Matching with Recourse
with Spyros Angelopoulos, Shendan Jin. International Symposium on Mathematical Foundations of Computer Science (MFCS), August 2018. Also will be presented at the Modern Online Algorithms workshop (MOLI), July 2018.
[paper, slides]
An Adversarial Model for Scheduling with Testing
with Thomas Erlebach, Nicole Megow, Julie Meißner. Preliminary version appeared under the title "Scheduling with Explorable Uncertainty" at The 9th Innovations in Theoretical Computer Science Conference (ITCS), Jan 2018.
[paper, slides]
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling
with Łukasz Jeż and Oscar C. Vasquez, Theoretical Computer Science, 695, 28-41, 2017. DOI: 10.1016/j.tcs.2017.07.020. Preliminary version was presented at The 9th Conference on Web and Internet Economics (WINE), 2013.
[paper, slides]
The triangle scheduling problem
with Zdeněk Hanzálek, Christian Konrad, Yasmina Seddik, René Sitters, Óscar C. Vásquez and Gerhard Woeginger, Journal of Scheduling, 21(3), 305-312, 2018. DOI: 10.1007/s10951-017-0533-1.
[paper, slides, program]
The local-global conjecture for scheduling with non-linear cost
with Nikhil Bansal, Nguyễn Kim Thắng and Oscar C. Vásquez, Journal of Scheduling, 20(3), 2017. DOI:10.1007/s10951-015-0466-5. Preliminary version was presented at The 16th Workshop on Algorithm Engineering and Experiments (ALENEX), 2014, under the title "Order constraints for single machine scheduling with non-linear cost".
[paper, program]
Infinite linear programming and online searching with turn cost
with Spyros Angelopoulos and Diogo Arsénio. Theoretical Computer Science, 2017. DOI: 10.1016/j.tcs.2017.01.013