Marek Chrobak

Proceedings of the Theory and Applications of Models of Computation, 2024

On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

2023

A Note on Local Convergence of Iterative Processes for Pipe Network Analysis.

[BibT_eX]

[DOI]

Huong Luu

CoRR, 2023

Structural Properties of Search Trees with 2-way Comparisons.

[BibT_eX]

[DOI]

CoRR, 2023

Classification via two-way comparisons.

[BibT_eX]

[DOI]

CoRR, 2023

Better Hardness Results for the Minimum Spanning Tree Congestion Problem.

[BibT_eX]

[DOI]

Huong Luu

Proceedings of the WALCOM: Algorithms and Computation, 2023

Classification via Two-Way Comparisons (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Online Paging with Heterogeneous Cache Slots.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Cross-Chain Swaps with Preferences.

[BibT_eX]

[DOI]

Eric Chan

Mohsen Lesani

Proceedings of the 36th IEEE Computer Security Foundations Symposium, 2023

2022

A Simple Algorithm for Optimal Search Trees with Two-way Comparisons.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

On Huang and Wong's algorithm for generalized binary split trees.

[BibT_eX]

[DOI]

Acta Informatica, 2022

2021

New results on multi-level aggregation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Scheduling with gaps: new models and algorithms.

[BibT_eX]

[DOI]

J. Sched., 2021

On the cost of unsuccessful searches in search trees with two-way comparisons.

[BibT_eX]

[DOI]

Inf. Comput., 2021

Information gathering in ad-hoc radio networks.

[BibT_eX]

[DOI]

Kevin P. Costello

Inf. Comput., 2021

2020

Towards a theory of mixing graphs: A characterization of perfect mixability.

[BibT_eX]

[DOI]

Miguel Coviello Gonzalez

Theor. Comput. Sci., 2020

A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips.

[BibT_eX]

[DOI]

Miguel Coviello Gonzalez

ACM J. Exp. Algorithmics, 2020

Online Algorithms for Multilevel Aggregation.

[BibT_eX]

[DOI]

Oper. Res., 2020

Online Clique Clustering.

[BibT_eX]

[DOI]

Algorithmica, 2020

Modeling Fluid Mixing in Microfluidic Grids.

[BibT_eX]

[DOI]

Huong Luu

Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

2019

Online packet scheduling with bounded delay and lookahead.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs.

[BibT_eX]

[DOI]

Alexander Choi

Kevin P. Costello

CoRR, 2019

A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Better Bounds for Online Line Chasing.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability (Extended Abstract).

[BibT_eX]

[DOI]

Miguel Coviello Gonzalez

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Information gathering in ad-hoc radio networks with tree topology.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Faster Information Gathering in Ad-Hoc Radio Tree Networks.

[BibT_eX]

[DOI]

Kevin P. Costello

Algorithmica, 2018

2017

A greedy approximation algorithm for minimum-gap scheduling.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

Uriel Feige

Sanjeev Khanna

Fei Li

Seffi Naor

J. Sched., 2017

2016

Work-Function Algorithm for k-Servers.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Algorithm DC-Tree for k-Servers on Trees.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Online Algorithms for Multi-Level Aggregation.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Slowing the Firehose: Multi-Dimensional Diversity on Social Post Streams.

[BibT_eX]

[DOI]

Shiwen Cheng

Odile Bellenguez-Morineau

Vagelis Hristidis

Proceedings of the 19th International Conference on Extending Database Technology, 2016

2015

Approximation algorithms for the joint replenishment problem with deadlines.

[BibT_eX]

[DOI]

J. Sched., 2015

A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines.

[BibT_eX]

[DOI]

Damien Prot

J. Sched., 2015

LP-rounding algorithms for the fault-tolerant facility placement problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Optimal search trees with equality tests.

[BibT_eX]

[DOI]

CoRR, 2015

Group Search on the Line.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Optimal Search Trees with 2-Way Comparisons.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Competitive Strategies for Online Clique Clustering.

[BibT_eX]

[DOI]

Bengt J. Nilsson

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014

Online aggregation problems.

[BibT_eX]

[DOI]

SIGACT News, 2014

Approximation Algorithms for Clique Clustering.

[BibT_eX]

[DOI]

Bengt J. Nilsson

CoRR, 2014

PRISE2: Software for designing sequence-selective PCR primers and probes.

[BibT_eX]

[DOI]

BMC Bioinform., 2014

Algorithms for Placing Monitors in a Flow Network.

[BibT_eX]

[DOI]

Francis Y. L. Chin

Algorithmica, 2014

An LP-Rounding Algorithm for Degenerate Primer Design.

[BibT_eX]

[DOI]

Yu-Ting Huang

Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

Sequence Decision Diagrams.

[BibT_eX]

[DOI]

Hind Alhakami

Gianfranco Ciardo

Proceedings of the String Processing and Information Retrieval, 2014

Better Approximation Bounds for the Joint Replenishment Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Multi-Query Diversification in Microblogging Posts.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Extending Database Technology, 2014

2013

Better bounds for incremental frequency allocation in bipartite graphs.

[BibT_eX]

[DOI]

Lukasz Jez

Theor. Comput. Sci., 2013

A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Better Approximation Bounds for the Joint Replenishment Problem.

[BibT_eX]

[DOI]

CoRR, 2013

Collecting Weighted Items from a Dynamic Queue.

[BibT_eX]

[DOI]

Algorithmica, 2013

Online Control Message Aggregation in Chain Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Together or Separate? Algorithmic Aggregation Problems.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012

Algorithmic Aspects of Energy-Efficient Computing.

[BibT_eX]

[DOI]

Srikanth V. Krishnamurthy

Proceedings of the Handbook of Energy-Aware and Green Computing - Two Volume Set., 2012

Obtaining Provably Legitimate Internet Topologies.

[BibT_eX]

[DOI]

Yihua He

Michalis Faloutsos

IEEE/ACM Trans. Netw., 2012

Polynomial-time algorithms for minimum energy scheduling.

[BibT_eX]

[DOI]

Philippe Baptiste

ACM Trans. Algorithms, 2012

Approximation Algorithms for the Joint Replenishment Problem with Deadlines

[BibT_eX]

[DOI]

Marcin Bienkowski

Jaroslaw Byrka

CoRR, 2012

Caching Is Hard - Even in the Fault Model.

[BibT_eX]

[DOI]

Algorithmica, 2012

Tile-Packing Tomography Is NP-hard.

[BibT_eX]

[DOI]

Algorithmica, 2012

2011

Better bounds for incremental medians.

[BibT_eX]

[DOI]

Mathilde Hurand

Theor. Comput. Sci., 2011

Randomized competitive algorithms for online buffer management in the adaptive adversary model.

[BibT_eX]

[DOI]

Marcin Bienkowski

Lukasz Jez

Theor. Comput. Sci., 2011

Algorithms for temperature-aware task scheduling in microprocessor systems.

[BibT_eX]

[DOI]

Sustain. Comput. Informatics Syst., 2011

SIGACT news online algorithms column 19.

[BibT_eX]

[DOI]

SIGACT News, 2011

Approximation algorithms for the Fault-Tolerant Facility Placement problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

New Results on the Fault-Tolerant Facility Placement Problem

[BibT_eX]

[DOI]

CoRR, 2011

Two-Bounded-Space Bin Packing Revisited.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Proceedings of the Algorithms - ESA 2011, 2011

2010

Three results on frequency assignment in linear cellular networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Performance-aware thermal management via task scheduling.

[BibT_eX]

[DOI]

ACM Trans. Archit. Code Optim., 2010

SIGACT news online algorithms column 17.

[BibT_eX]

[DOI]

SIGACT News, 2010

SIGACT news online algorithms column 16.

[BibT_eX]

[DOI]

SIGACT News, 2010

A low-cost memory remapping scheme for address bus protection.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2010

Tile-Packing Tomography Is \mathbbNP{\mathbb{NP}}-hard.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

Introduction to the SIGACT news online algorithms column.

[BibT_eX]

[DOI]

SIGACT News, 2009

SIGACT news online algorithms column 14.

[BibT_eX]

[DOI]

SIGACT News, 2009

Algorithms for testing fault-tolerance of sequenced jobs.

[BibT_eX]

[DOI]

Mathilde Hurand

J. Sched., 2009

2008

Work-Function Algorithm for k Servers.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Algorithm DC-Tree for kServers on Trees.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

SIGACT news online algorithms column 13: 2007 - an offine perspective.

[BibT_eX]

[DOI]

SIGACT News, 2008

Generalized Whac-a-Mole

[BibT_eX]

[DOI]

CoRR, 2008

Competitive Analysis of Scheduling Algorithms for Aggregated Links.

[BibT_eX]

[DOI]

Wojciech Jawor

Algorithmica, 2008

Incremental Medians via Online Bidding.

[BibT_eX]

[DOI]

Algorithmica, 2008

Experimental Analysis of Scheduling Algorithms for Aggregated Links.

[BibT_eX]

[DOI]

Wojciech Jawor

Mart L. Molle

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Randomized Algorithms for Buffer Management with 2-Bounded Delay.

[BibT_eX]

[DOI]

Marcin Bienkowski

Srikanth V. Krishnamurthy

Lukasz Jez

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Dynamic Thermal Management through Task Scheduling.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software, 2008

Policy-Aware Topologies for Efficient Inter-Domain Routing Evaluations.

[BibT_eX]

[DOI]

Yihua He

Michalis Faloutsos

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007

Improved online algorithms for buffer management in QoS switches.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Competitiveness via primal-dual.

[BibT_eX]

[DOI]

SIGACT News, 2007

Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

The Wake-Up Problem in MultiHop Radio Networks.

[BibT_eX]

[DOI]

Dariusz R. Kowalski

SIAM J. Comput., 2007

The complexity of mean flow time scheduling problems with release times.

[BibT_eX]

[DOI]

Svetlana A. Kravchenko

Francis Sourd

J. Sched., 2007

Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2007

Sampling large Internet topologies for simulation purposes.

[BibT_eX]

[DOI]

Vaishnavi Krishnamurthy

Comput. Networks, 2007

Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines.

[BibT_eX]

[DOI]

Mathilde Hurand

Proceedings of the 28th IEEE Real-Time Systems Symposium (RTSS 2007), 2007

2006

SIGACT news online algorithms column 10: competitiveness via doubling.

[BibT_eX]

[DOI]

Claire Kenyon-Mathieu

SIGACT News, 2006

2005: an offline persepctive.

[BibT_eX]

[DOI]

SIGACT News, 2006

A Note on Scheduling Equal-Length Jobs to Maximize Throughput.

[BibT_eX]

[DOI]

J. Sched., 2006

Online competitive algorithms for maximizing weighted throughput of unit jobs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

The reverse greedy algorithm for the metric k-median problem.

[BibT_eX]

[DOI]

Claire Kenyon

Inf. Process. Lett., 2006

Oblivious Medians Via Online Bidding.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

A low-cost memory remapping scheme for address bus protection.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Parallel Architectures and Compilation Techniques (PACT 2006), 2006

2005

The greedy algorithm for the minimum common string partition problem.

[BibT_eX]

[DOI]

Petr Kolman

ACM Trans. Algorithms, 2005

SIGACT news online algorithms column 8.

[BibT_eX]

[DOI]

SIGACT News, 2005

The reverse greedy algorithm for the metric k-median problem

[BibT_eX]

[DOI]

Claire Kenyon

CoRR, 2005

Reducing Large Internet Topologies for Faster Simulations.

[BibT_eX]

[DOI]

Vaishnavi Krishnamurthy

Proceedings of the NETWORKING 2005: Networking Technologies, 2005

2004

The weighted 2-server problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Coordination mechanisms for congestion games.

[BibT_eX]

[DOI]

Elias Koutsoupias

SIGACT News, 2004

SIGACT news online algorithms column 4.

[BibT_eX]

[DOI]

SIGACT News, 2004

A princess swimming in the fog looking for a monster cow.

[BibT_eX]

[DOI]

SIGACT News, 2004

SIGACT news online algorithms column 2.

[BibT_eX]

[DOI]

SIGACT News, 2004

Preemptive scheduling of equal-length jobs to maximize weighted throughput.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

A randomized algorithm for gossiping in radio networks.

[BibT_eX]

[DOI]

Networks, 2004

Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time

[BibT_eX]

[DOI]

CoRR, 2004

Errata to Analysis of the Harmonic Algorithm for Three Servers.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

The wake-up problem in multi-hop radio networks.

[BibT_eX]

[DOI]

Dariusz R. Kowalski

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

More on randomized on-line algorithms for caching.

[BibT_eX]

[DOI]

Elias Koutsoupias

Theor. Comput. Sci., 2003

On tiling under tomographic constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

SIGACT news online algorithms column 1.

[BibT_eX]

[DOI]

SIGACT News, 2003

Preemptive scheduling in overloaded systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

Analysis of the Harmonic Algorithm for Three Servers.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Faster Algorithms for k-Medians in Trees.

[BibT_eX]

[DOI]

Robert Benkoczi

Binay K. Bhattacharya

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002

The 3-server problem in the plane.

[BibT_eX]

[DOI]

Wolfgang W. Bein

Theor. Comput. Sci., 2002

Solution of a problem in DNA computing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Fast broadcasting and gossiping in radio networks.

[BibT_eX]

[DOI]

J. Algorithms, 2002

More on random walks, electrical networks, and the harmonic k-server algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

2001

Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

A Note on Tiling under Tomographic Constraints

[BibT_eX]

[DOI]

CoRR, 2001

The k-Median Problem for Directed Trees.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

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

[BibT_eX]

James Borneman

Gianluca Della Vedova

Andres Figueroa

Tao Jiang

Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, 2001

The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Competitive analysis of randomized paging algorithms.

[BibT_eX]

[DOI]

Dimitris Achlioptas

Theor. Comput. Sci., 2000

Competitive Algorithms for Relaxed List Update and Multilevel Caching.

[BibT_eX]

[DOI]

J. Algorithms, 2000

A simple analysis of the harmonic algorithm for two servers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

A Randomized Algorithm for Two Servers on the Line.

[BibT_eX]

[DOI]

Yair Bartal

Inf. Comput., 2000

Computing simple paths among obstacles.

[BibT_eX]

[DOI]

Qi Cheng

Gopalakrishnan Sundaram

Comput. Geom., 2000

1999

Reconstructing hv-Convex Polyominoes from Orthogonal Projections.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

LRU Is Better than FIFO.

[BibT_eX]

[DOI]

Algorithmica, 1999

1998

Minimum-width grid drawings of plane graphs.

[BibT_eX]

[DOI]

Shin-Ichi Nakano

Comput. Geom., 1998

Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

A Randomized Algorithm for Two Servers on the Line (Extended Abstract).

[BibT_eX]

[DOI]

Yair Bartal

Proceedings of the Algorithms, 1998

1997

Page Migration Algorithms Using Work Functions.

[BibT_eX]

[DOI]

J. Algorithms, 1997

A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Convex Grid Drawings of 3-Connected Planar Graphs.

[BibT_eX]

[DOI]

Goos Kant

Int. J. Comput. Geom. Appl., 1997

1996

Competive Analysis of Randomized Paging Algorithms.

[BibT_eX]

[DOI]

Dimitris Achlioptas

Proceedings of the Algorithms, 1996

Bibliography on Competitive Algorithms.

[BibT_eX]

Proceedings of the Online Algorithms, 1996

Metrical Task Systems, the Server Problem and the Work Function Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Online Algorithms, 1996

Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version).

[BibT_eX]

[DOI]

Michael T. Goodrich

Roberto Tamassia

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

A Linear-Time Algorithm for Drawing a Planar Graph on a Grid.

[BibT_eX]

[DOI]

T. H. Payne

Inf. Process. Lett., 1995

1994

Two Results on Linear Embeddings of Complete Binary Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Generosity Helps or an 11-Competitive Algorithm for Three Servers.

[BibT_eX]

[DOI]

J. Algorithms, 1994

1992

Harmonic is 3-Competitive for Two Servers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

1991

Connectivity vs. Reachability

[BibT_eX]

[DOI]

Howard J. Karloff

Tomasz Radzik

Inf. Comput., April, 1991

Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices.

[BibT_eX]

[DOI]

David Eppstein

Theor. Comput. Sci., 1991

A New Approach to the Server Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1991

New Results on Server Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1991

An Optimal On-Line Algorithm for k-Servers on Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

On Fast Algorithms for Two Servers.

[BibT_eX]

[DOI]

J. Algorithms, 1991

A Note on the Server Problem and a Benevolent Adversary.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

An Efficient Parallel Algorithm for Computing a Large Independent Set in Planar Graph.

[BibT_eX]

[DOI]

Joseph Naor

Algorithmica, 1991

Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

The Server Problem and On-Line Games.

[BibT_eX]

[DOI]

Proceedings of the On-Line Algorithms, 1991

1990

A Data Structure Useful for Finding Hamiltonian Cycles.

[BibT_eX]

[DOI]

Tomasz Szymacha

Adam Krawczyk

Theor. Comput. Sci., 1990

Improved Edge-Coloring Algorithms for Planar Graphs.

[BibT_eX]

[DOI]

Takao Nishizeki

J. Algorithms, 1990

1989

A lower bound on the size of universal sets for planar graphs.

[BibT_eX]

[DOI]

Howard J. Karloff

SIGACT News, 1989

Optimal Parallel 5-Colouring of Planar Graphs.

[BibT_eX]

[DOI]

Torben Hagerup

Krzysztof Diks

SIAM J. Comput., 1989

Fast Algorithms for Edge-Coloring Planar Graphs.

[BibT_eX]

[DOI]

Moti Yung

J. Algorithms, 1989

Using Bounded Degree Spanning Trees in the Design of Efficient Algorithms on Claw-Free Graphs.

[BibT_eX]

[DOI]

Joseph Naor

Mark B. Novick

Proceedings of the Algorithms and Data Structures, 1989

An Efficient Parallel Algorithm for Computing a Large Independent Set in a Plan Graph.

[BibT_eX]

[DOI]

Joseph Naor

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

1988

k+1 Heads Are Better than k for PDAs.

[BibT_eX]

[DOI]

Ming Li

J. Comput. Syst. Sci., 1988

On Some Packing Problem Related to Dynamic Storage Allocation.

[BibT_eX]

[DOI]

Maciej Slusarek

RAIRO Theor. Informatics Appl., 1988

A Note on Random Sampling.

[BibT_eX]

[DOI]

Richard Harter

Inf. Process. Lett., 1988

On common edges in optimal solutions to traveling salesman and other optimization problems.

[BibT_eX]

[DOI]

Svatopluk Poljak

Discret. Appl. Math., 1988

Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs.

[BibT_eX]

[DOI]

Moti Yung

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

Remarks on String-Matching and One-Way Multihead Automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

Parallel 5-Colouring of Planar Graphs.

[BibT_eX]

[DOI]

Torben Hagerup

Krzysztof Diks

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Saturating Flows in Networks.

[BibT_eX]

[DOI]

Bogdan S. Chlebus

Krzysztof Diks

Proceedings of the Fundamentals of Computation Theory, 1987

1986

Hierarchies of One-Way Multihead Automata Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Finite Automata and Unary Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Unique Deciperability for Partially Commutative Alphabet (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

k+1 Heads Are Better than k for PDA's

[BibT_eX]

[DOI]

Ming Li

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

A Characterization of Reversal-Bounded Multipushdown Machine Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Variations on the Technique of Duris and Galil.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1985

1984

Probabilistic Turing Machines and Recursively Enumerable Dedekind Cuts.

[BibT_eX]

[DOI]

Bogdan S. Chlebus

Inf. Process. Lett., 1984

A Note on Bounded-Reversal Multipushdown Machines.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

Nondeterminism Is Essential for Two-Way Counter Machines.

[BibT_eX]

[DOI]