Jurek Czyzowicz

Tomasz Jurdzinski

Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

Priority Evacuation from a Disk Using Mobile Robots - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2018

Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2018

Linear Rendezvous with Asymmetric Clocks.

[BibT_eX]

[DOI]

Ryan Killick

Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

God Save the Queen.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017

Collision-free network exploration.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots.

[BibT_eX]

[DOI]

Algorithmica, 2017

Evacuation from a Disc in the Presence of a Faulty Robot.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2017

Linear Search with Terrain-Dependent Speeds.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Energy-Optimal Broadcast in a Tree with Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2017

Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2017

2016

Survivability of bouncing robots.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2016

Flows in Temporal networks.

[BibT_eX]

[DOI]

CoRR, 2016

Convergecast and Broadcast by Power-Aware Mobile Agents.

[BibT_eX]

[DOI]

Algorithmica, 2016

Communication Problems for Mobile Agents Exchanging Energy.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2016

Distributed Patrolling with Two-Speed Robots (and an Application to Transportation).

[BibT_eX]

[DOI]

Dominik Pajak

Proceedings of the Operations Research and Enterprise Systems, 2016

Fence Patrolling with Two-speed Robots.

[BibT_eX]

[DOI]

Dominik Pajak

Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016

Patrolling Trees with Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Foundations and Practice of Security - 9th International Symposium, 2016

2015

The Beachcombers' Problem: Walking and searching with mobile robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Position discovery for a system of bouncing robots.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Monitoring the Plane with Rotating Radars.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Localization for a system of colliding robots.

[BibT_eX]

[DOI]

Eduardo Pacheco

Distributed Comput., 2015

Algorithms for Communication Problems for Mobile Agents Exchanging Energy.

[BibT_eX]

[DOI]

CoRR, 2015

Information Spreading by Mobile Particles on a Line.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract).

[BibT_eX]

[DOI]

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

Wireless Autonomous Robot Evacuation from Equilateral Triangles and Squares.

[BibT_eX]

[DOI]

Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 14th International Conference, 2015

2014

Time versus space trade-offs for rendezvous in trees.

[BibT_eX]

[DOI]

Distributed Comput., 2014

Evacuating Robots via Unknown Exit in a Disk.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Patrolling by Robots Equipped with Visibility.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2014

Survivability of Swarms of Bouncing Robots.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

The Multi-source Beachcombers' Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2014

2013

Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Worst-case optimal exploration of terrains with obstacles.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Optimal patrolling of fragmented boundaries.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

2012

Choosing the best among peers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

More efficient periodic traversal in anonymous undirected graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

How to meet asynchronously (almost) everywhere.

[BibT_eX]

[DOI]

Arnaud Labourel

ACM Trans. Algorithms, 2012

How to meet when you forget: log-space rendezvous in arbitrary graphs.

[BibT_eX]

[DOI]

Distributed Comput., 2012

Collecting Information by Power-Aware Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Time vs. space trade-offs for rendezvous in trees.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Tree Exploration by a Swarm of Mobile Agents.

[BibT_eX]

[DOI]

Mélanie Roy

Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011

Consensus and Mutual Exclusion in a Multiple Access Channel.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2011

Asynchronous deterministic rendezvous in bounded terrains.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Local 7-coloring for planar subgraphs of unit disk graphs.

[BibT_eX]

[DOI]

Stefan Dobrev

Hernán González-Aguilar

Theor. Comput. Sci., 2011

Approximation Algorithms for Buy-at-Bulk Geometric Network Design.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Optimality and competitiveness of exploring polygons by mobile robots.

[BibT_eX]

[DOI]

Arnaud Labourel

Inf. Comput., 2011

Synchronous Rendezvous for Location-Aware Agents.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

2010

Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Optimal Exploration of Terrains with Obstacles.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Tell Me Where I Am So I Can Meet You Sooner.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Efficient Information Exchange in the Random Phone-Call Model.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment.

[BibT_eX]

[DOI]

Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 9th International Conference, 2010

2009

Gathering few fat mobile robots in the plane.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Local edge colouring of Yao-like subgraphs of Unit Disk Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Black Hole Search in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2009

On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment.

[BibT_eX]

[DOI]

Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, 2009

2008

Computing the throughput of Concatenation State Machines.

[BibT_eX]

[DOI]

Wojciech Fraczak

Mohammadreza Yazdani

J. Discrete Algorithms, 2008

The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring.

[BibT_eX]

[DOI]

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

Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes.

[BibT_eX]

[DOI]

Stefan Dobrev

Thomas Fevens

Hernán González-Aguilar

Jaroslav Opatrny

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Equivalence of simple functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Simultaneous diagonal flips in plane triangulations.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Reducing Simple Grammars: Exponential against Highly-Polynomial Time in Practice.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Searching for a Black Hole in Synchronous Tree Networks.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

Assigning Bookmarks in Perfect Binary Trees.

[BibT_eX]

Ars Comb., 2007

Efficient Computation of Throughput Values of Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2007

2006

Prime normal form and equivalence of simple grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Complexity of Searching for a Black Hole.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

Equivalence of Functions Represented by Simple Context-Free Grammars with Output.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005

Transducers with Set Output.

[BibT_eX]

[DOI]

Wojciech Fraczak

J. Autom. Lang. Comb., 2005

2004

The Maximum Number of Edges in a Three-Dimensional Grid-Drawing.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2004

Searching for a Black Hole in Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

2003

Enhancing Hyperlink Structure for Improving Web Performance.

[BibT_eX]

[DOI]

J. Web Eng., 2003

Linear-Time Prime Decomposition Of Regular Prefix Codes.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

2002

Prime Decompositions of Regular Prefix Codes.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2002

2001

Circular Separability of Polygons.

[BibT_eX]

[DOI]

Olivier Devillers

Mariette Yvinec

Algorithmica, 2001

2000

Computing Largest Circles Separating Two Sets of Segments.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2000

Strategies for Hotlink Assignments.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Guarding the Convex Subsets of a Point-set.

[BibT_eX]

[DOI]

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

Flipping your Lid.

[BibT_eX]

[DOI]

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999

Immobilizing a Shape.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1999

Convex tours of bounded curvature.

[BibT_eX]

[DOI]

Comput. Geom., 1999

Dissections, cuts and triangulations.

[BibT_eX]

[DOI]

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

Domino tilings of orthogonal polygons.

[BibT_eX]

[DOI]

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

Near optimal-partitioning of rectangles and prisms.

[BibT_eX]

[DOI]

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998

A Simple Proof of the Representation of Bipartite Planar Graphs as the Contact Graphs of Orthogonal Straight Line Segments.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Algorithms for Packing Two Circles in a Convex Polygon.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Polygon Cutting: Revisited.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Optimal Floodlight Illumination of Stages.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

On measuring areas of polygons.

[BibT_eX]

[DOI]

F. Contreras-Alcalá

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Illuminating triangles and quadrilaterals with vertex floodlights.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Cutting rectangles in equal area pieces.

[BibT_eX]

[DOI]

Prosenjit Bose

Dominic Lessard

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Separating Translates in the Plane: Combinatorial Bounds and an Algorithm.

[BibT_eX]

[DOI]

Hazel Everett

Jean-Marc Robert

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

Discrete Realizations of Contact and Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Domino tilings and two-by-two squares.

[BibT_eX]

Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996

On a Problem of Immobilizing Polygons.

[BibT_eX]

[DOI]

Tomasz Szymacha

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

Maximal Length Common Non-intersecting Paths.

[BibT_eX]

[DOI]

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

On illuminating line segments in the plane.

[BibT_eX]

[DOI]

Discret. Math., 1995

Circular Separability of Polygon.

[BibT_eX]

[DOI]

Olivier Devillers

Mariette Yvinec

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994

Protecting convex sets.

[BibT_eX]

[DOI]

Graphs Comb., 1994

Searching with Local Constraints on Error Patterns.

[BibT_eX]

[DOI]

K. B. Lakshmanan

Eur. J. Comb., 1994

Separation of Convex Sets.

[BibT_eX]

[DOI]

Eduardo Rivera-Campo

Discret. Appl. Math., 1994

Guarding rectangular art galleries.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

K-Guarding Polygons on the Plane.

[BibT_eX]

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Illuminating Rectangles and Triangles in the Plane.

[BibT_eX]

[DOI]

Eduardo Rivera-Campo

J. Comb. Theory, Ser. B, 1993

Optimal Floodlight Illumination of Stages.

[BibT_eX]

Eduardo Rivera-Campo

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

Computing shortest transversals of sets.

[BibT_eX]

[DOI]

Binay K. Bhattacharya

Peter Egyed

Godfried T. Toussaint

Int. J. Comput. Geom. Appl., 1992

Separating Convex Sets in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1992

1991

Lattice diagrams with few slopes.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1991

Searching with a Forbidden Lie Pattern in Responses.

[BibT_eX]

[DOI]

K. B. Lakshmanan

Inf. Process. Lett., 1991

Tight Bounds for the Rectangualr Art Gallery Problem.

[BibT_eX]

[DOI]

Proceedings of the 17th International Workshop, 1991

Immobilizing a Polytope.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1991

The Aquarium Keeper's Problem.

[BibT_eX]

[DOI]

Godfried T. Toussaint

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

Computing Shortest Transversals of Sets (Extended Abstract).

[BibT_eX]

[DOI]

Binay K. Bhattacharya

Peter Egyed

Godfried T. Toussaint

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Drawing orders with few slopes.

[BibT_eX]

[DOI]

Ivan Rival

Discret. Math., 1990

1989

Ulam's searching game with lies.

[BibT_eX]

[DOI]

Daniele Mundici

J. Comb. Theory, Ser. A, 1989

Galleries, Light Matchings and Visibility Graphs.

[BibT_eX]

[DOI]

Ivan Rival

Proceedings of the Algorithms and Data Structures, 1989

1988

Solution of Ulam's problem on binary search with two lies.

[BibT_eX]

[DOI]

Daniele Mundici

J. Comb. Theory, Ser. A, 1988

1985

Implementing generic types in Modula-2.

[BibT_eX]

[DOI]