Marek Chrobak

ORCID

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 50

Top Venues

Publications

Emily Clark, Chloe Georgiou, Katelyn Poon, Marek Chrobak
On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps. CoRR (2024)
Sunny Atalig, Marek Chrobak
A Tight Threshold Bound for Search Trees with 2-Way Comparisons. TAMC (2024)
Jordan Kuschner, Yugarshi Shashwat, Sarthak Yadav, Marek Chrobak
On Permutation Selectors and their Applications in Ad-Hoc Radio Networks Protocols. CoRR (2024)
Marek Chrobak, Neal E. Young
Classification via Two-Way Comparisons (Extended Abstract). WADS (2023)
Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young
Online Paging with Heterogeneous Cache Slots. STACS (2023)
Marek Chrobak, Neal E. Young
Classification via two-way comparisons. CoRR (2023)
Eric Chan, Marek Chrobak, Mohsen Lesani
Cross-Chain Swaps with Preferences. CSF (2023)
Sunny Atalig, Marek Chrobak
A Tight Threshold Bound for Search Trees with 2-way Comparisons. CoRR (2023)
Huong Luu, Marek Chrobak
Better Hardness Results for the Minimum Spanning Tree Congestion Problem. WALCOM (2023)
Huong Luu, Marek Chrobak
A Note on Local Convergence of Iterative Processes for Pipe Network Analysis. CoRR (2023)
Sunny Atalig, Marek Chrobak, Erfan Mousavian, Jiri Sgall, Pavel Veselý
Structural Properties of Search Trees with 2-way Comparisons. CoRR (2023)
Huong Luu, Marek Chrobak
Better Hardness Results for the Minimum Spanning Tree Congestion Problem. CoRR (2022)
Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines. SIAM J. Comput. 51 (5) (2022)
Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young
Online Paging with Heterogeneous Cache Slots. CoRR (2022)
Eric Chan, Marek Chrobak, Mohsen Lesani
Cross-chain Swaps with Preferences. CoRR (2022)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons. ACM Trans. Algorithms 18 (1) (2022)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
On Huang and Wong's algorithm for generalized binary split trees. Acta Informatica 59 (6) (2022)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
On the Cost of Unsuccessful Searches in Search Trees with Two-way Comparisons. CoRR (2021)
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
New results on multi-level aggregation. Theor. Comput. Sci. 861 (2021)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons. CoRR (2021)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
On the cost of unsuccessful searches in search trees with two-way comparisons. Inf. Comput. 281 (2021)
Marek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng
Scheduling with gaps: new models and algorithms. J. Sched. 24 (4) (2021)
Marek Chrobak, Kevin P. Costello, Leszek Gasieniec
Information gathering in ad-hoc radio networks. Inf. Comput. 281 (2021)
Miguel Coviello Gonzalez, Marek Chrobak
A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips. ACM J. Exp. Algorithmics 25 (2020)
Marek Chrobak, Christoph Dürr, Aleksander Fabijan, Bengt J. Nilsson
Online Clique Clustering. Algorithmica 82 (4) (2020)
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
Online Algorithms for Multilevel Aggregation. Oper. Res. 68 (1) (2020)
Miguel Coviello Gonzalez, Marek Chrobak
Towards a theory of mixing graphs: A characterization of perfect mixability. Theor. Comput. Sci. 845 (2020)
Qi Fu, Elizabeth Bent, James Borneman, Marek Chrobak, Neal E. Young
Algorithmic approaches to selecting control clones in DNA array hybridization experiments. CoRR (2020)
Miguel Coviello Gonzalez, Marek Chrobak
A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips. WALCOM (2020)
Huong Luu, Marek Chrobak
Modeling Fluid Mixing in Microfluidic Grids. CSC (2020)
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
Online packet scheduling with bounded delay and lookahead. Theor. Comput. Sci. 776 (2019)
Marek Chrobak, Kevin P. Costello, Leszek Gasieniec
Information Gathering in Ad-Hoc Radio Networks. CoRR (2019)
Miguel Coviello Gonzalez, Marek Chrobak
A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips. CoRR (2019)
Alexander Choi, Marek Chrobak, Kevin P. Costello
An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs. CoRR (2019)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias
Better Bounds for Online Line Chasing. MFCS (2019)
Miguel Coviello Gonzalez, Marek Chrobak
Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability (Extended Abstract). CIAC (2019)
Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall
A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines. SODA (2019)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
On Huang and Wong's Algorithm for Generalized Binary Split Trees. CoRR (2019)
Huong Luu, Marek Chrobak
Modeling Fluid Mixing in Microfluidic Grids. CoRR (2019)
Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall
A φ-Competitive Algorithm for Scheduling Packets with Deadlines. CoRR (2018)
Miguel Coviello Gonzalez, Marek Chrobak
Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability. CoRR (2018)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias
Better Bounds for Online Line Chasing. CoRR (2018)
Marek Chrobak, Kevin P. Costello, Leszek Gasieniec, Dariusz R. Kowalski
Information gathering in ad-hoc radio networks with tree topology. Inf. Comput. 258 (2018)
Marek Chrobak, Kevin P. Costello
Faster Information Gathering in Ad-Hoc Radio Tree Networks. Algorithmica 80 (3) (2018)
Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor
A greedy approximation algorithm for minimum-gap scheduling. J. Sched. 20 (3) (2017)
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
Online Packet Scheduling with Bounded Delay and Lookahead. ISAAC (2016)
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, Pavel Veselý
Online Algorithms for Multi-Level Aggregation. ESA (2016)
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
Online Packet Scheduling with Bounded Delay and Lookahead. CoRR (2016)
Shiwen Cheng, Marek Chrobak, Vagelis Hristidis
Slowing the Firehose: Multi-Dimensional Diversity on Social Post Streams. EDBT (2016)
Marek Chrobak, Kevin P. Costello
Faster Information Gathering in Ad-Hoc Radio Tree Networks. LATIN (2016)
Marek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng
Scheduling with Gaps: New Models and Algorithms. CIAC (2015)
Li Yan, Marek Chrobak
LP-rounding algorithms for the fault-tolerant facility placement problem. J. Discrete Algorithms 33 (2015)
Odile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr, Damien Prot
A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines. J. Sched. 18 (3) (2015)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
Optimal Search Trees with 2-Way Comparisons. ISAAC (2015)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young
Approximation algorithms for the joint replenishment problem with deadlines. J. Sched. 18 (6) (2015)
Marek Chrobak, Leszek Gasieniec, Thomas Gorry, Russell Martin
Group Search on the Line. SOFSEM (2015)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
Optimal search trees with equality tests. CoRR (2015)
Marek Chrobak, Kevin P. Costello
Faster Information Gathering in Ad-Hoc Radio Tree Networks. CoRR (2015)
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
Online Algorithms for Multi-Level Aggregation. CoRR (2015)
Marek Chrobak, Christoph Dürr, Bengt J. Nilsson
Competitive Strategies for Online Clique Clustering. CIAC (2015)
Odile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr, Damien Prot
A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines. CoRR (2014)
Yu-Ting Huang, Marek Chrobak
An LP-Rounding Algorithm for Degenerate Primer Design. WABI (2014)
Marek Chrobak, Christoph Dürr, Bengt J. Nilsson
Approximation Algorithms for Clique Clustering. CoRR (2014)
Francis Y. L. Chin, Marek Chrobak, Li Yan
Algorithms for Placing Monitors in a Flow Network. Algorithmica 68 (1) (2014)
Marek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng
Scheduling with Gaps: New Models and Algorithms. CoRR (2014)
Yu-Ting Huang, Jiue-in Yang, Marek Chrobak, James Borneman
PRISE2: Software for designing sequence-selective PCR primers and probes. BMC Bioinform. 15 (2014)
Shiwen Cheng, Anastasios Arvanitis, Marek Chrobak, Vagelis Hristidis
Multi-Query Diversification in Microblogging Posts. EDBT (2014)
Marek Chrobak
Online aggregation problems. SIGACT News 45 (1) (2014)
Marek Chrobak, Kevin P. Costello, Leszek Gasieniec, Dariusz R. Kowalski
Information Gathering in Ad-Hoc Radio Networks with Tree Topology. CoRR (2014)
Marek Chrobak, Kevin P. Costello, Leszek Gasieniec, Darek Kowalski
Information Gathering in Ad-Hoc Radio Networks with Tree Topology. COCOA (2014)
Hind Alhakami, Gianfranco Ciardo, Marek Chrobak
Sequence Decision Diagrams. SPIRE (2014)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Dorian Nogneng, Jirí Sgall
Better Approximation Bounds for the Joint Replenishment Problem. SODA (2014)
Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak
-competitive algorithm for collecting items with increasing weights from a dynamic queue. Theor. Comput. Sci. 475 (2013)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young
Approximation Algorithms for the Joint Replenishment Problem with Deadlines. ICALP (1) (2013)
Marek Chrobak
Together or Separate? Algorithmic Aggregation Problems. FCT (2013)
Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak
Collecting Weighted Items from a Dynamic Queue. Algorithmica 65 (1) (2013)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jirí Sgall
Better Approximation Bounds for the Joint Replenishment Problem. CoRR (2013)
Marek Chrobak, Lukasz Jez, Jirí Sgall
Better bounds for incremental frequency allocation in bipartite graphs. Theor. Comput. Sci. 514 (2013)
Li Yan, Marek Chrobak
LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem. CIAC (2013)
Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor
A Greedy Approximation Algorithm for Minimum-Gap Scheduling. CIAC (2013)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jirí Sgall, Grzegorz Stachowiak
Online Control Message Aggregation in Chain Networks. WADS (2013)
Li Yan, Marek Chrobak
LP-rounding Algorithms for the Fault-Tolerant Facility Placement Problem CoRR (2012)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak
Approximation Algorithms for the Joint Replenishment Problem with Deadlines CoRR (2012)
Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Kim Thang Nguyen
Tile-Packing Tomography Is NP-hard. Algorithmica 64 (2) (2012)
Yihua He, Michalis Faloutsos, Srikanth V. Krishnamurthy, Marek Chrobak
Obtaining Provably Legitimate Internet Topologies. IEEE/ACM Trans. Netw. 20 (1) (2012)
Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu
Caching Is Hard - Even in the Fault Model. Algorithmica 63 (4) (2012)
Philippe Baptiste, Marek Chrobak, Christoph Dürr
Polynomial-time algorithms for minimum energy scheduling. ACM Trans. Algorithms 8 (3) (2012)
Marek Chrobak, Lukasz Jez, Jirí Sgall
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs. ESA (2011)
Marek Chrobak, Lukasz Jez, Jirí Sgall
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs CoRR (2011)
Marek Chrobak, Christoph Dürr, Mathilde Hurand, Julien Robert
Algorithms for temperature-aware task scheduling in microprocessor systems. Sustain. Comput. Informatics Syst. 1 (3) (2011)
Li Yan, Marek Chrobak
New Results on the Fault-Tolerant Facility Placement Problem CoRR (2011)
Marek Chrobak, Mathilde Hurand
Better bounds for incremental medians. Theor. Comput. Sci. 412 (7) (2011)
Marek Chrobak, Jirí Sgall, Gerhard J. Woeginger
Two-Bounded-Space Bin Packing Revisited. ESA (2011)
Marek Chrobak
SIGACT news online algorithms column 19. SIGACT News 42 (2) (2011)
Li Yan, Marek Chrobak
Approximation algorithms for the Fault-Tolerant Facility Placement problem. Inf. Process. Lett. 111 (11) (2011)
Marcin Bienkowski, Marek Chrobak, Lukasz Jez
Randomized competitive algorithms for online buffer management in the adaptive adversary model. Theor. Comput. Sci. 412 (39) (2011)
Marek Chrobak
SIGACT news online algorithms column 17. SIGACT News 41 (4) (2010)
Jun Yang, Lan Gao, Youtao Zhang, Marek Chrobak, Hsien-Hsin S. Lee
A low-cost memory remapping scheme for address bus protection. J. Parallel Distributed Comput. 70 (5) (2010)
Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Kim Thang Nguyen
{\mathbb{NP}}-hard. COCOON (2010)
Marek Chrobak
SIGACT news online algorithms column 16. SIGACT News 41 (1) (2010)

Marek Chrobak.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Marek Chrobak