World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
48
Citations
7150
World Ranking
6258
National Ranking
2797

Overview

Marek Chrobak is affiliated with the University of California, Riverside in the United States. Their research contributions are primarily situated within the fields of Computer Science and Engineering.

The scientist's main areas of study include:

  • Artificial Intelligence
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Electrical and Electronic Engineering
  • Information Systems

The research topics covered by their work span:

  • Advanced Graph Theory Research
  • Algorithms and Data Compression
  • Optimization and Search Problems
  • Complexity and Algorithms in Graphs
  • Machine Learning and Algorithms
  • Scheduling and Optimization Algorithms
  • Advanced Wireless Network Optimization

Marek Chrobak's recent papers provide insight into their current research foci. Notable publications include:

  • A Simple Algorithm for Optimal Search Trees with Two-way Comparisons, 2021, published in ACM Transactions on Algorithms
  • Online Algorithms for Multilevel Aggregation, 2020, published in Operations Research
  • A φ-Competitive Algorithm for Scheduling Packets with Deadlines, 2022, published in SIAM Journal on Computing
  • New results on multi-level aggregation, 2021, published in Theoretical Computer Science
  • Online Paging with Heterogeneous Cache Slots, 2024, published in Algorithmica

The scientist frequently publishes in venues such as:

  • arXiv (Cornell University)
  • Theoretical Computer Science
  • ACM Transactions on Algorithms
  • Algorithmica
  • Information and Computation

Collaborations have included frequent co-authors such as:

  • Neal E. Young
  • Huong Luu
  • Sunny Atalig
  • Mordecai J. Golin
  • Jiřı́ Sgall

Best Publications

  • New results on server problems

    M. Chrobak;H. Karloff;T. Payne;S. Vishwanathan

  • Fast broadcasting and gossiping in radio networks

    Marek Chrobak;Leszek Gasieniec;Wojciech Rytter

  • Finite automata and unary languages

    M Chrobak

  • Fast broadcasting and gossiping in radio networks

    M. Chrobak;L. Gasieniec;W. Rytter

  • A linear-time algorithm for drawing a planar graph on a grid

    M. Chrobak;T. H. Payne

  • An optimal on-line algorithm for K-servers on trees

    Marek Chrobak;Lawrence L. Larmore

  • Convex grid drawings of 3-connected planar graphs

    Marek Chrobak;Goos Kant

  • Dynamic Thermal Management through Task Scheduling

    Jun Yang;Xiuyi Zhou;M. Chrobak;Youtao Zhang

  • Analysis of Bacterial Community Composition by Oligonucleotide Fingerprinting of rRNA Genes

    Lea Valinsky;Gianluca Della Vedova;Alexandra J. Scupham;Sam Alvey

  • Reconstructing hv-convex polyominoes from orthogonal projections

    Marek Chrobak;Christoph Dürr

  • Competitive analysis of randomized paging algorithms

    Dimitris Achlioptas;Marek Chrobak;John Noga

  • Planar orientations with low out-degree and compaction of adjacency matrices

    Marek Chrobak;David Eppstein

  • The Server Problem and On-Line Games.

    Marek Chrobak;Lawrence L. Larmore

  • LRU Is Better than FIFO

    Marek Chrobak;John Noga

  • Reducing large internet topologies for faster simulations

    V. Krishnamurthy;M. Faloutsos;M. Chrobak;L. Lao

  • Convex drawings of graphs in two and three dimensions (preliminary version)

    Marek Chrobak;Michael T. Goodrich;Roberto Tamassia

  • Minimum-width grid drawings of plane graphs

    Marek Chrobak;Shin-Ichi Nakano

  • Probe selection algorithms with applications in the analysis of microbial communities.

    James Borneman;Marek Chrobak;Gianluca Della Vedova;Andres Figueroa

  • On some packing problem related to dynamic storage allocation

    Marek Chrobak;Maciej Ślusarek

  • The Wake-Up Problem in MultiHop Radio Networks

    Marek Chrobak;Leszek Ga¸sieniec;Dariusz R. Kowalski

  • Reconstructing hv-Convex Polyominoes from Orthogonal Projections

    Christoph Durr;Marek Chrobak

  • Online competitive algorithms for maximizing weighted throughput of unit jobs

    Yair Bartall;Francis Y. L. Chin;Marek Chrobak;Stanley P. Y. Fung

Frequent Co-Authors

Jiří Sgall
Jiří Sgall Charles University
Neal E. Young
Neal E. Young University of California, Riverside
Wojciech Rytter
Wojciech Rytter University of Warsaw
Leszek Gasieniec
Leszek Gasieniec University of Liverpool
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Claire Kenyon
Claire Kenyon Brown University
James Borneman
James Borneman University of California, Riverside
J. Ian Munro
J. Ian Munro University of Waterloo
Francis Y. L. Chin
Francis Y. L. Chin University of Hong Kong
Dariusz R. Kowalski
Dariusz R. Kowalski Augusta University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Advancing your education in Computer Science doesn't always require a lengthy or expensive commitment. For students seeking flexible options, there are a wide variety of online programs tailored to fit different career goals and budgets.

For those interested in combining technical and business skills, exploring the cheapest mba programs can be a smart step. These MBA degrees help computer science professionals move into leadership and management roles without breaking the bank.

If you’re looking to fast-track your education, consider one of the 1 year masters programs in related fields. These accelerated options allow you to earn a graduate degree quickly and enter the workforce sooner.

Alternatively, programs listed among fast degrees online can open doors to well-paying tech jobs with a shorter time investment.

With AI playing a crucial role in modern computing, you might also want to investigate the best online ai degrees for specialized skills that are increasingly in demand.

Best Scientists Citing Marek Chrobak

Trending Scientists

Recently Published Articles