MPI-INF Logo
  • Home
  • MPI-INF D1 Publications, generated: 21:30, 27 September 2023

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 31 documents:

  1. Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
    Nicole Megow and Julian Mestre
    In: 4th Conference on Innovations in Theoretical Computer Science (ITCS 2013), Berkeley, 2013
  2. Max-coloring paths: tight bounds and extensions
    Telikepalli Kavitha and Julián Mestre
    Journal of Combinatiorial Optimization 24 (1): 1-14, 2012
  3. Optimization Problems in Dotted Interval Graphs
    Danny Hermelin, Julian Mestre, and Dror Rawitz
    In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, Jerusalem, Israel, 2012, 46-56
  4. Universal sequencing on an unreliable machine
    Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julian Mestre, Martin Skutella, and Leen Stougie
    SIAM Journal on Computing 41 (3): 565-586, 2012
  5. Approximation Algorithms for the Interval Constrained Coloring Problem
    Ernst Althaus, Stefan Canzar, Khaled Elbassioni, Andreas Karrenbauer, and Julian Mestre
    Algorithmica 61 (2): 342-361, 2011
  6. Improved Approximations for Guarding 1.5-Dimensional Terrains
    Khaled Elbassioni, Erik Krohn, Domagoj Matijevic, Julian Mestre, and Domagoj Severdija
    Algorithmica 60 (2): 451-463, 2011
  7. On Tree-Constrained Matchings and Generalizations
    Stefan Canzar, Khaled Elbassioni, Gunnar W. Klau, and Julian Mestre

  8. On Tree-Constrained Matchings and Generalizations
    Stefan Canzar, Khaled Elbassioni, Gunnar W. Klau, and Julian Mestre
    In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, 2011, 98-109
  9. Popular mixed matchings
    Telikepalli Kavitha, Julian Mestre, and Meghana Nasre
    Theoretical Computer Science 412 (24): 2679-2690, 2011
  10. A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem
    Stefan Canzar, Khaled Elbassioni, and Julian Mestre
    In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), Austin, Texas, 2010, 23-33
  11. Adaptive local ratio
    Julian Mestre
    SIAM Journal on Computing 39 (7): 3038-3057, 2010
  12. Assigning Papers to Referees
    Naveen Garg, T. Kavitha, Amit Kumar, Kurt Mehlhorn, and Julián Mestre
    Algorithmica 58 (1): 119-136, 2010
  13. Improved approximation guarantees for weighted matching in the semi-streaming model
    Leah Epstein, Asaf Levin, Julian Mestre, and Danny Segev
    In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), Nancy, France, 2010, 347-358
  14. Max-coloring paths: Tight bounds and extensions
    Telikepalli Kavitha and Julian Mestre
    Journal of Combinatorial Optimization Online First: 1 - 14, 2010
  15. The Checkpoint Problem
    MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, and Julian Mestre
    In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Barcelona, Spain, 2010, 219-231
  16. Universal sequencing on a single machine
    Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julian Mestre, Martin Skutella, and Leen Stougie
    In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, Lausanne, Switzerland, 2010, 230-243
  17. When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract)
    Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, and Atri Rudra
    In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, Liverpool, UK, 2010, 218-229
  18. Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
    Rajiv Gandhi and Julián Mestre
    Algorithmica 54 (1): 54-71, 2009
  19. Improved Approximation Algorithms for 1.5D Terrain Guarding
    Khaled Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, and Domagoj Severdija
    In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), Freiburg - Germany, 2009, 361-371
  20. Improved Approximations for Guarding 1.5-Dimensional Terrains
    Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, and Domagoj Severdija
    Algorithmica Online First: 1-13, 2009
  21. Max-coloring paths: Tight bounds and extensions
    Telikepalli Kavitha and Julian Mestre
    In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, Hawai, USA, 2009, 87-96
  22. Parametric Packing of Selfish Items and the Subset Sum Algorithm
    Leah Epstein, Elena Kleiman, and Julian Mestre
    In: Internet and Network Economics : 5th International Workshop, WINE 2009, Rome, Italy, 2009, 67-78
  23. Popular Mixed Matchings
    T. Kavitha, Julián Mestre, and M. Nasre
    In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, 2009, 574-584
  24. Adaptive Local Ratio
    Julián Mestre
    In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, USA, 2008, 152-160
  25. An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
    Samir Khuller and Julián Mestre
    In: 16th Annual European Symposium on Algorithms (ESA), Karlsruhe, Germany, 2008, 601-610
  26. Approximating the Interval Constrained Coloring Problem
    Ernst Althaus, Stefan Canzar, Khaled Elbassioni, Andreas Karrenbauer, and Julián Mestre
    In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), Gothenburg, Sweden, 2008, 210-221
  27. Assigning Papers to Referees
    Naveen Garg, T. Kavitha, Amit Kumar, Kurt Mehlhorn, and Julián Mestre

    [PDF: Download: RefereeAssignment.pdf]
  28. Essential Complex Biological Modules Explain the Centrality-Lethality Rule
    Elena Zotenko, Julián Mestre, Dianne O'Leary, and Teresa Przytyzka
    PLoS Computational Biology x, 2008
  29. Lagrangian Relaxation and Partial Cover (Extended Abstract)
    Julián Mestre
    In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS), Bordeaux, France, 2008, 539-550
  30. Approximation of Partial Capacitated Vertex Cover
    Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, and Dror Rawitz
    In: 15th Annual European Symposium on Algorithms, Eilat, Israel, 2007, 335-346
  31. To Fill or Not to Fill: The Gas Station Problem
    Samir Khuller, Azarakhsh Malekian, and Julián Mestre
    In: 15th Annual European Symposium on Algorithms, Eilat, Israel, 2007, 534-545