![]() | ![]() |
| 2012 | ||
|---|---|---|
| 164 | Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu: Caching Is Hard - Even in the Fault Model. Algorithmica 63(4): 781-794 (2012) | |
| 163 | Yihua He, Michalis Faloutsos, Srikanth V. Krishnamurthy, Marek Chrobak: Obtaining Provably Legitimate Internet Topologies. IEEE/ACM Trans. Netw. 20(1): 271-284 (2012) | |
| 2011 | ||
| 162 | Marek Chrobak, Lukasz Jez, Jiri Sgall: Better Bounds for Incremental Frequency Allocation in Bipartite Graphs. ESA 2011: 251-262 | |
| 161 | Marek Chrobak, Jiri Sgall, Gerhard J. Woeginger: Two-Bounded-Space Bin Packing Revisited. ESA 2011: 263-274 | |
| 160 | Marek Chrobak, Lukasz Jez, Jiri Sgall: Better Bounds for Incremental Frequency Allocation in Bipartite Graphs CoRR abs/1102.3393: (2011) | |
| 159 | Li Yan, Marek Chrobak: New Results on the Fault-Tolerant Facility Placement Problem CoRR abs/1108.5471: (2011) | |
| 158 | Li Yan, Marek Chrobak: Approximation algorithms for the Fault-Tolerant Facility Placement problem. Inf. Process. Lett. 111(11): 545-549 (2011) | |
| 157 | Marek Chrobak: SIGACT news online algorithms column 19. SIGACT News 42(2): 82 (2011) | |
| 156 | Marcin Bienkowski, Marek Chrobak, Lukasz Jez: Randomized competitive algorithms for online buffer management in the adaptive adversary model. Theor. Comput. Sci. 412(39): 5121-5131 (2011) | |
| 155 | Marek Chrobak, Mathilde Hurand: Better bounds for incremental medians. Theor. Comput. Sci. 412(7): 594-601 (2011) | |
| 2010 | ||
| 154 | Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Nguyen Kim Thang: Tile-Packing Tomography Is \mathbbNP{\mathbb{NP}}-hard. COCOON 2010: 254-263 | |
| 153 | Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu: Caching Is Hard - Even in the Fault Model. ESA (1) 2010: 195-206 | |
| 152 | Jun Yang, Lan Gao, Youtao Zhang, Marek Chrobak, Hsien-Hsin S. Lee: A low-cost memory remapping scheme for address bus protection. J. Parallel Distrib. Comput. 70(5): 443-457 (2010) | |
| 151 | Marek Chrobak: SIGACT news online algorithms column 16. SIGACT News 41(1): 99 (2010) | |
| 150 | Marek Chrobak: SIGACT news online algorithms column 17. SIGACT News 41(4): 114-121 (2010) | |
| 149 | Xiuyi Zhou, Jun Yang, Marek Chrobak, Youtao Zhang: Performance-aware thermal management via task scheduling. TACO 7(1): (2010) | |
| 148 | Marek Chrobak, Jiri Sgall: Three results on frequency assignment in linear cellular networks. Theor. Comput. Sci. 411(1): 131-137 (2010) | |
| 2009 | ||
| 147 | Francis Y. L. Chin, Marek Chrobak, Li Yan: Algorithms for Placing Monitors in a Flow Network. AAIM 2009: 114-128 | |
| 146 | Marek Chrobak, Jiri Sgall: Three Results on Frequency Assignment in Linear Cellular Networks. AAIM 2009: 129-139 | |
| 145 | Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak: Collecting weighted items from a dynamic queue. SODA 2009: 1126-1135 | |
| 144 | Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial Time Algorithms for Minimum Energy Scheduling CoRR abs/0908.3505: (2009) | |
| 143 | Francis Y. L. Chin, Marek Chrobak, Li Yan: Algorithms for Placing Monitors in a Flow Network CoRR abs/0908.4309: (2009) | |
| 142 | Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Nguyen Kim Thang: Tile Packing Tomography is NP-hard CoRR abs/0911.2567: (2009) | |
| 141 | Marek Chrobak, Mathilde Hurand, Jiri Sgall: Algorithms for testing fault-tolerance of sequenced jobs. J. Scheduling 12(5): 501-515 (2009) | |
| 140 | Marek Chrobak: SIGACT news online algorithms column 14. SIGACT News 40(3): 86-98 (2009) | |
| 139 | Marek Chrobak: Introduction to the SIGACT news online algorithms column. SIGACT News 40(4): 98 (2009) | |
| 2008 | ||
| 138 | Marek Chrobak, Christoph Dürr, Mathilde Hurand, Julien Robert: Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems. AAIM 2008: 120-130 | |
| 137 | Yihua He, Michalis Faloutsos, Srikanth V. Krishnamurthy, Marek Chrobak: Policy-Aware Topologies for Efficient Inter-Domain Routing Evaluations. INFOCOM 2008: 2342-2350 | |
| 136 | Jun Yang, Xiuyi Zhou, Marek Chrobak, Youtao Zhang, Lingling Jin: Dynamic Thermal Management through Task Scheduling. ISPASS 2008: 191-201 | |
| 135 | Wojciech Jawor, Marek Chrobak, Mart Molle: Experimental Analysis of Scheduling Algorithms for Aggregated Links. WAOA 2008: 253-266 | |
| 134 | Marcin Bienkowski, Marek Chrobak, Lukasz Jez: Randomized Algorithms for Buffer Management with 2-Bounded Delay. WAOA 2008: 92-104 | |
| 133 | Marek Chrobak: Algorithm DC-Tree for kServers on Trees. Encyclopedia of Algorithms 2008 | |
| 132 | Marek Chrobak: Work-Function Algorithm for k Servers. Encyclopedia of Algorithms 2008 | |
| 131 | Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young: Incremental Medians via Online Bidding. Algorithmica 50(4): 455-478 (2008) | |
| 130 | Wojciech Jawor, Marek Chrobak, Christoph Dürr: Competitive Analysis of Scheduling Algorithms for Aggregated Links. Algorithmica 51(4): 367-386 (2008) | |
| 129 | Marek Chrobak, Christoph Dürr, Mathilde Hurand, Julien Robert: Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems CoRR abs/0801.4238: (2008) | |
| 128 | Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Jakub Lopuszanski, Grzegorz Stachowiak: Generalized Whac-a-Mole CoRR abs/0802.1685: (2008) | |
| 127 | Marek Chrobak: SIGACT news online algorithms column 13: 2007 - an offine perspective. SIGACT News 39(3): 96-121 (2008) | |
| 2007 | ||
| 126 | Qi Fu, Elizabeth Bent, James Borneman, Marek Chrobak, Neal E. Young: Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments. APBC 2007: 17-26 | |
| 125 | Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial Time Algorithms for Minimum Energy Scheduling. ESA 2007: 136-150 | |
| 124 | Marek Chrobak, Mathilde Hurand, Jiri Sgall: Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines. RTSS 2007: 139-148 | |
| 123 | Marek Chrobak, Mathilde Hurand: Better Bounds for Incremental Medians. WAOA 2007: 207-217 | |
| 122 | Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý: Improved online algorithms for buffer management in QoS switches. ACM Transactions on Algorithms 3(4): (2007) | |
| 121 | Vaishnavi Krishnamurthy, Michalis Faloutsos, Marek Chrobak, Jun-Hong Cui, Li Lao, Allon G. Percus: Sampling large Internet topologies for simulation purposes. Computer Networks 51(15): 4284-4302 (2007) | |
| 120 | Qi Fu, Elizabeth Bent, James Borneman, Marek Chrobak, Neal E. Young: Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments. J. Bioinformatics and Computational Biology 5(4): 937-961 (2007) | |
| 119 | Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd: The complexity of mean flow time scheduling problems with release times. J. Scheduling 10(2): 139-146 (2007) | |
| 118 | Marek Chrobak, Leszek Gasieniec, Dariusz R. Kowalski: The Wake-Up Problem in MultiHop Radio Networks. SIAM J. Comput. 36(5): 1453-1471 (2007) | |
| 117 | Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý: Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help. SIAM J. Comput. 36(6): 1709-1728 (2007) | |
| 116 | Marek Chrobak: Competitiveness via primal-dual. SIGACT News 38(3): 100-105 (2007) | |
| 2006 | ||
| 115 | Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young: Oblivious Medians Via Online Bidding. LATIN 2006: 311-322 | |
| 114 | Wojciech Jawor, Marek Chrobak, Christoph Dürr: Competitive Analysis of Scheduling Algorithms for Aggregated Links. LATIN 2006: 617-628 | |
| 113 | Lan Gao, Jun Yang, Marek Chrobak, Youtao Zhang, San Nguyen, Hsien-Hsin S. Lee: A low-cost memory remapping scheme for address bus protection. PACT 2006: 74-83 | |
| 112 | Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd: The Complexity of Mean Flow Time Scheduling Problems with Release Times CoRR abs/cs/0605078: (2006) | |
| 111 | Marek Chrobak, Claire Kenyon, Neal E. Young: The reverse greedy algorithm for the metric k-median problem. Inf. Process. Lett. 97(2): 68-72 (2006) | |
| 110 | Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Jiri Sgall, Tomás Tichý: Online competitive algorithms for maximizing weighted throughput of unit jobs. J. Discrete Algorithms 4(2): 255-276 (2006) | |
| 109 | Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski: A Note on Scheduling Equal-Length Jobs to Maximize Throughput. J. Scheduling 9(1): 71-73 (2006) | |
| 108 | Marek Chrobak: 2005: an offline persepctive. SIGACT News 37(1): 82-98 (2006) | |
| 107 | Marek Chrobak, Claire Kenyon-Mathieu: SIGACT news online algorithms column 10: competitiveness via doubling. SIGACT News 37(4): 115-126 (2006) | |
| 2005 | ||
| 106 | Marek Chrobak, Claire Kenyon, Neal E. Young: The Reverse Greedy Algorithm for the Metric K-Median Problem. COCOON 2005: 654-660 | |
| 105 | Vaishnavi Krishnamurthy, Michalis Faloutsos, Marek Chrobak, Li Lao, Jun-Hong Cui, Allon G. Percus: Reducing Large Internet Topologies for Faster Simulations. NETWORKING 2005: 328-341 | |
| 104 | Marek Chrobak, Petr Kolman, Jiri Sgall: The greedy algorithm for the minimum common string partition problem. ACM Transactions on Algorithms 1(2): 350-366 (2005) | |
| 103 | Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young: Oblivious Medians via Online Bidding CoRR abs/cs/0504103: (2005) | |
| 102 | Marek Chrobak, Claire Kenyon, Neal E. Young: The reverse greedy algorithm for the metric k-median problem CoRR abs/cs/0504104: (2005) | |
| 101 | Marek Chrobak: SIGACT news online algorithms column 8. SIGACT News 36(3): 67 (2005) | |
| 2004 | ||
| 100 | Marek Chrobak, Petr Kolman, Jiri Sgall: The Greedy Algorithm for the Minimum Common String Partition Problem. APPROX-RANDOM 2004: 84-95 | |
| 99 | Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý: Improved Online Algorithms for Buffer Management in QoS Switches. ESA 2004: 204-215 | |
| 98 | Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý: Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help. ICALP 2004: 358-370 | |
| 97 | Marek Chrobak, Leszek Gasieniec, Dariusz R. Kowalski: The wake-up problem in multi-hop radio networks. SODA 2004: 992-1000 | |
| 96 | Yair Bartal, Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Ron Lavi, Jiri Sgall, Tomás Tichý: Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs. STACS 2004: 187-198 | |
| 95 | Marek Chrobak, Jiri Sgall: Errata to Analysis of the Harmonic Algorithm for Three Servers. STACS 2004: 656 | |
| 94 | Philippe Baptiste, Marek Chrobak, Christoph Dürr, Francis Sourd: Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time CoRR abs/cs/0412094: (2004) | |
| 93 | Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski: A Note on Scheduling Equal-Length Jobs to Maximize Throughput CoRR cs.DS/0410046: (2004) | |
| 92 | Marek Chrobak, Leszek Gasieniec, Wojciech Rytter: A randomized algorithm for gossiping in radio networks. Networks 43(2): 119-124 (2004) | |
| 91 | Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania: Preemptive scheduling of equal-length jobs to maximize weighted throughput. Oper. Res. Lett. 32(3): 258-264 (2004) | |
| 90 | Marek Chrobak: SIGACT news online algorithms column 2. SIGACT News 35(1): 38-48 (2004) | |
| 89 | Marek Chrobak: A princess swimming in the fog looking for a monster cow. SIGACT News 35(2): 74-78 (2004) | |
| 88 | Marek Chrobak: SIGACT news online algorithms column 4. SIGACT News 35(3): 58-66 (2004) | |
| 87 | Marek Chrobak, Elias Koutsoupias: Coordination mechanisms for congestion games. SIGACT News 35(4): 58-71 (2004) | |
| 86 | Marek Chrobak, Jiri Sgall: The weighted 2-server problem. Theor. Comput. Sci. 324(2-3): 289-312 (2004) | |
| 2003 | ||
| 85 | Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter: Faster Algorithms for k-Medians in Trees. MFCS 2003: 218-227 | |
| 84 | Marek Chrobak, Jiri Sgall: Analysis of the Harmonic Algorithm for Three Servers. STACS 2003: 247-259 | |
| 83 | Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania: Preemptive scheduling in overloaded systems. J. Comput. Syst. Sci. 67(1): 183-197 (2003) | |
| 82 | Marek Chrobak: SIGACT news online algorithms column 1. SIGACT News 34(4): 68-77 (2003) | |
| 81 | Marek Chrobak, Elias Koutsoupias, John Noga: More on randomized on-line algorithms for caching. Theor. Comput. Sci. 290(3): 1997-2008 (2003) | |
| 80 | Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger: On tiling under tomographic constraints. Theor. Comput. Sci. 290(3): 2125-2136 (2003) | |
| 2002 | ||
| 79 | Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania: Preemptive Scheduling in Overloaded Systems. ICALP 2002: 800-811 | |
| 78 | Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania: Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput CoRR cs.DS/0209033: (2002) | |
| 77 | Yair Bartal, Marek Chrobak, John Noga, Prabhakar Raghavan: More on random walks, electrical networks, and the harmonic k-server algorithm. Inf. Process. Lett. 84(5): 271-276 (2002) | |
| 76 | Marek Chrobak, Leszek Gasieniec, Wojciech Rytter: Fast broadcasting and gossiping in radio networks. J. Algorithms 43(2): 177-189 (2002) | |
| 75 | Eric Anderson, Marek Chrobak, John Noga, Jiri Sgall, Gerhard J. Woeginger: Solution of a problem in DNA computing. Theor. Comput. Sci. 287(2): 387-391 (2002) | |
| 74 | Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore: The 3-server problem in the plane. Theor. Comput. Sci. 289(1): 335-354 (2002) | |
| 2001 | ||
| 73 | Marek Chrobak, Leszek Gasieniec, Wojciech Rytter: A Randomized Algorithm for Gossiping in Radio Networks. COCOON 2001: 483-492 | |
| 72 | Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jiri Sgall, Gerhard J. Woeginger: The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP 2001: 862-874 | |
| 71 | James Borneman, Marek Chrobak, Gianluca Della Vedova, Andres Figueroa, Tao Jiang: Probe selection algorithms with applications in the analysis of microbial communities. ISMB (Supplement of Bioinformatics) 2001: 39-48 | |
| 70 | Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter: The k-Median Problem for Directed Trees. MFCS 2001: 260-271 | |
| 69 | Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger: A Note on Tiling under Tomographic Constraints CoRR cs.CC/0108010: (2001) | |
| 68 | Marek Chrobak, Christoph Dürr: Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms. Theor. Comput. Sci. 259(1-2): 81-98 (2001) | |
| 2000 | ||
| 67 | Marek Chrobak, Leszek Gasieniec, Wojciech Rytter: Fast Broadcasting and Gossiping in Radio Networks. FOCS 2000: 575-581 | |
| 66 | Marek Chrobak, Jiri Sgall: The Weighted 2-Server Problem. STACS 2000: 593-604 | |
| 65 | Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram: Computing simple paths among obstacles. Comput. Geom. 16(4): 223-233 (2000) | |
| 64 | Yair Bartal, Marek Chrobak, Lawrence L. Larmore: A Randomized Algorithm for Two Servers on the Line. Inf. Comput. 158(1): 53-69 (2000) | |
| 63 | Marek Chrobak, Jiri Sgall: A simple analysis of the harmonic algorithm for two servers. Inf. Process. Lett. 75(1-2): 75-77 (2000) | |
| 62 | Marek Chrobak, John Noga: Competitive Algorithms for Relaxed List Update and Multilevel Caching. J. Algorithms 34(2): 282-308 (2000) | |
| 61 | Dimitris Achlioptas, Marek Chrobak, John Noga: Competitive analysis of randomized paging algorithms. Theor. Comput. Sci. 234(1-2): 203-218 (2000) | |
| 1999 | ||
| 60 | Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore: The 3-Server Problem in the Plane. ESA 1999: 301-312 | |
| 59 | Marek Chrobak, John Noga: LRU Is Better than FIFO. Algorithmica 23(2): 180-185 (1999) | |
| 58 | Christoph Dürr, Marek Chrobak: Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms CoRR cs.DS/9906018: (1999) | |
| 57 | Christoph Dürr, Marek Chrobak: Reconstructing hv-Convex Polyominoes from Orthogonal Projections CoRR cs.DS/9906021: (1999) | |
| 56 | Marek Chrobak, Christoph Dürr: Reconstructing hv-Convex Polyominoes from Orthogonal Projections. Inf. Process. Lett. 69(6): 283-289 (1999) | |
| 1998 | ||
| 55 | Yair Bartal, Marek Chrobak, Lawrence L. Larmore: A Randomized Algorithm for Two Servers on the Line (Extended Abstract). ESA 1998: 247-258 | |
| 54 | Marek Chrobak, Christoph Dürr: Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms. MFCS 1998: 185-193 | |
| 53 | Marek Chrobak, John Noga: LRU is Better than FIFO. SODA 1998: 78-81 | |
| 52 | Marek Chrobak, John Noga: Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract). SODA 1998: 87-96 | |
| 51 | Marek Chrobak, Shin-Ichi Nakano: Minimum-width grid drawings of plane graphs. Comput. Geom. 11(1): 29-54 (1998) | |
| 1997 | ||
| 50 | Marek Chrobak, Lawrence L. Larmore, Carsten Lund, Nick Reingold: A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem. Inf. Process. Lett. 63(2): 79-83 (1997) | |
| 49 | Marek Chrobak, Goos Kant: Convex Grid Drawings of 3-Connected Planar Graphs. Int. J. Comput. Geometry Appl. 7(3): 211-223 (1997) | |
| 48 | Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook: Page Migration Algorithms Using Work Functions. J. Algorithms 24(1): 124-157 (1997) | |
| 1996 | ||
| 47 | Dimitris Achlioptas, Marek Chrobak, John Noga: Competive Analysis of Randomized Paging Algorithms. ESA 1996: 419-430 | |
| 46 | Marek Chrobak, John Noga: Bibliography on Competitive Algorithms. Online Algorithms 1996: 395-436 | |
| 45 | Marek Chrobak, Lawrence L. Larmore: Metrical Task Systems, the Server Problem and the Work Function Algorithm. Online Algorithms 1996: 74-96 | |
| 44 | Marek Chrobak, Michael T. Goodrich, Roberto Tamassia: Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version). Symposium on Computational Geometry 1996: 319-328 | |
| 1995 | ||
| 43 | Marek Chrobak, T. H. Payne: A Linear-Time Algorithm for Drawing a Planar Graph on a Grid. Inf. Process. Lett. 54(4): 241-246 (1995) | |
| 1994 | ||
| 42 | Marek Chrobak, Shin-Ichi Nakano: Minimum-Width Grid Drawings of Plane Graphs. Graph Drawing 1994: 104-110 | |
| 41 | Marek Chrobak, Lawrence L. Larmore: Generosity Helps or an 11-Competitive Algorithm for Three Servers. J. Algorithms 16(2): 234-263 (1994) | |
| 40 | Marek Chrobak, Wojciech Rytter: Two Results on Linear Embeddings of Complete Binary Trees. Theor. Comput. Sci. 136(2): 507-526 (1994) | |
| 1993 | ||
| 39 | Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook: Page Migration Algorithms Using Work Functions. ISAAC 1993: 406-415 | |
| 1992 | ||
| 38 | Marek Chrobak, Lawrence L. Larmore: Generosity Helps, or an 11-Competitive Algorithm for Three Servers. SODA 1992: 196-202 | |
| 37 | Marek Chrobak, Lawrence L. Larmore: Harmonic is 3-Competitive for Two Servers. Theor. Comput. Sci. 98(2): 339-346 (1992) | |
| 1991 | ||
| 36 | Marek Chrobak, David Eppstein, Giuseppe F. Italiano, Moti Yung: Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths. SODA 1991: 158-167 | |
| 35 | Marek Chrobak, Joseph Naor: An Efficient Parallel Algorithm for Computing a Large Independent Set in Planar Graph. Algorithmica 6(6): 801-815 (1991) | |
| 34 | Marek Chrobak, Howard J. Karloff, Tomasz Radzik: Connectivity vs. Reachability Inf. Comput. 91(2): 177-188 (1991) | |
| 33 | Marek Chrobak, Lawrence L. Larmore: A Note on the Server Problem and a Benevolent Adversary. Inf. Process. Lett. 38(4): 173-175 (1991) | |
| 32 | Marek Chrobak, Lawrence L. Larmore: On Fast Algorithms for Two Servers. J. Algorithms 12(4): 607-614 (1991) | |
| 31 | Marek Chrobak, Lawrence L. Larmore: An Optimal On-Line Algorithm for k-Servers on Trees. SIAM J. Comput. 20(1): 144-148 (1991) | |
| 30 | Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan: New Results on Server Problems. SIAM J. Discrete Math. 4(2): 172-181 (1991) | |
| 29 | Marek Chrobak, Lawrence L. Larmore: A New Approach to the Server Problem. SIAM J. Discrete Math. 4(3): 323-328 (1991) | |
| 28 | Marek Chrobak, David Eppstein: Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices. Theor. Comput. Sci. 86(2): 243-266 (1991) | |
| 1990 | ||
| 27 | Marek Chrobak, Lawrence L. Larmore: On Fast Algorithms for Two Servers. MFCS 1990: 202-208 | |
| 26 | Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan: title=New Results on Server Problems. SODA 1990: 291-300 | |
| 25 | Marek Chrobak, Takao Nishizeki: Improved Edge-Coloring Algorithms for Planar Graphs. J. Algorithms 11(1): 102-116 (1990) | |
| 24 | Marek Chrobak, Tomasz Szymacha, Adam Krawczyk: A Data Structure Useful for Finding Hamiltonian Cycles. Theor. Comput. Sci. 71(3): 419-424 (1990) | |
| 1989 | ||
| 23 | Marek Chrobak, Joseph Naor: An Efficient Parallel Algorithm for Computing a Large Independent Set in a Plan Graph. SPAA 1989: 379-387 | |
| 22 | Marek Chrobak, Joseph Naor, Mark B. Novick: Using Bounded Degree Spanning Trees in the Design of Efficient Algorihtms on Claw-Free Graphs. WADS 1989: 147-162 | |
| 21 | Marek Chrobak, Moti Yung: Fast Algorithms for Edge-Coloring Planar Graphs. J. Algorithms 10(1): 35-51 (1989) | |
| 20 | Torben Hagerup, Marek Chrobak, Krzysztof Diks: Optimal Parallel 5-Colouring of Planar Graphs. SIAM J. Comput. 18(2): 288-300 (1989) | |
| 19 | Marek Chrobak, Howard J. Karloff: A lower bound on the size of universal sets for planar graphs. SIGACT News 20(4): 83-86 (1989) | |
| 1988 | ||
| 18 | Marek Chrobak, Moti Yung: Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs. AWOC 1988: 11-23 | |
| 17 | Marek Chrobak, Svatopluk Poljak: On common edges in optimal solutions to traveling salesman and other optimization problems. Discrete Applied Mathematics 20(2): 101-111 (1988) | |
| 16 | Marek Chrobak, Maciej Slusarek: On Some Packing Problem Related to Dynamic Storage Allocation. ITA 22(4): 487-499 (1988) | |
| 15 | Marek Chrobak, Richard Harter: A Note on Random Sampling. Inf. Process. Lett. 29(5): 255-256 (1988) | |
| 14 | Marek Chrobak, Ming Li: k+1 Heads Are Better than k for PDAs. J. Comput. Syst. Sci. 37(2): 144-155 (1988) | |
| 1987 | ||
| 13 | Bogdan S. Chlebus, Marek Chrobak, Krzysztof Diks: Saturating Flows in Networks. FCT 1987: 82-91 | |
| 12 | Torben Hagerup, Marek Chrobak, Krzysztof Diks: Parallel 5-Colouring of Planar Graphs. ICALP 1987: 304-313 | |
| 11 | Marek Chrobak, Wojciech Rytter: Remarks on String-Matching and One-Way Multihead Automata. Inf. Process. Lett. 24(5): 325-329 (1987) | |
| 1986 | ||
| 10 | Marek Chrobak, Ming Li: k+1 Heads Are Better than k for PDA's FOCS 1986: 361-367 | |
| 9 | Marek Chrobak, Wojciech Rytter: Unique Deciperability for Partially Commutative Alphabet (Extended Abstract). MFCS 1986: 256-263 | |
| 8 | Marek Chrobak: Finite Automata and Unary Languages. Theor. Comput. Sci. 47(3): 149-158 (1986) | |
| 7 | Marek Chrobak: Hierarchies of One-Way Multihead Automata Languages. Theor. Comput. Sci. 48(3): 153-181 (1986) | |
| 1985 | ||
| 6 | Marek Chrobak: Hierarchies of One-Way Multihead Automata Languages. ICALP 1985: 101-110 | |
| 5 | Marek Chrobak: Variations on the Technique of Duris and Galil. J. Comput. Syst. Sci. 30(1): 77-85 (1985) | |
| 4 | Wojciech Rytter, Marek Chrobak: A Characterization of Reversal-Bounded Multipushdown Machine Languages. Theor. Comput. Sci. 36: 341-344 (1985) | |
| 1984 | ||
| 3 | Marek Chrobak: Nondeterminism Is Essential for Two-Way Counter Machines. MFCS 1984: 240-244 | |
| 2 | Marek Chrobak, Bogdan S. Chlebus: Probabilistic Turing Machines and Recursively Enumerable Dedekind Cuts. Inf. Process. Lett. 19(4): 167-171 (1984) | |
| 1 | Marek Chrobak: A Note on Bounded-Reversal Multipushdown Machines. Inf. Process. Lett. 19(4): 179-180 (1984) | |
Colors in the list of coauthors
Last update Tue May 29 01:28:40 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page