Jurek Czyzowicz

According to our database1, Jurek Czyzowicz
  • authored at least 158 papers between 1985 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Collision-free network exploration.
J. Comput. Syst. Sci., 2017

Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots.
CoRR, 2017

Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits.
CoRR, 2017

Linear Search with Terrain-Dependent Speeds.
CoRR, 2017

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

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

Linear Search with Terrain-Dependent Speeds.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Temporal Flows in Temporal Networks.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Survivability of bouncing robots.
Discrete Math., Alg. and Appl., 2016

Search on a Line by Byzantine Robots.
CoRR, 2016

Convergecast and Broadcast by Power-Aware Mobile Agents.
CoRR, 2016

Flows in Temporal networks.
CoRR, 2016

Convergecast and Broadcast by Power-Aware Mobile Agents.
Algorithmica, 2016

Communication Problems for Mobile Agents Exchanging Energy.
Proceedings of the Structural Information and Communication Complexity, 2016

Linear Search by a Pair of Distinct-Speed Robots.
Proceedings of the Structural Information and Communication Complexity, 2016

Search on a Line with Faulty Robots.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Search on a Line by Byzantine Robots.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Fence Patrolling with Two-speed Robots.
Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016

Evacuating two robots from multiple unknown exits in a circle.
Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

Patrolling Trees with Mobile Robots.
Proceedings of the Foundations and Practice of Security - 9th International Symposium, 2016

2015
The Beachcombers' Problem: Walking and searching with mobile robots.
Theor. Comput. Sci., 2015

Position discovery for a system of bouncing robots.
Inf. Comput., 2015

Monitoring the Plane with Rotating Radars.
Graphs and Combinatorics, 2015

Localization for a system of colliding robots.
Distributed Computing, 2015

Evacuating Robots from a Disk Using Face-to-Face Communication.
CoRR, 2015

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols.
CoRR, 2015

Information Spreading by Mobile Particles on a Line.
Proceedings of the Structural Information and Communication Complexity, 2015

When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract).
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Beachcombing on Strips and Islands.
Proceedings of the Algorithms for Sensor Systems, 2015

Wireless Autonomous Robot Evacuation from Equilateral Triangles and Squares.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 14th International Conference, 2015

2014
Time versus space trade-offs for rendezvous in trees.
Distributed Computing, 2014

Optimal online and offline algorithms for robot-assisted restoration of barrier coverage.
CoRR, 2014

Evacuating Robots via Unknown Exit in a Disk.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Patrolling by Robots Equipped with Visibility.
Proceedings of the Structural Information and Communication Complexity, 2014

The Beachcombers' Problem: Walking and Searching with Mobile Robots.
Proceedings of the Structural Information and Communication Complexity, 2014

Survivability of Swarms of Bouncing Robots.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Collision-Free Network Exploration.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

The Multi-source Beachcombers' Problem.
Proceedings of the Algorithms for Sensor Systems, 2014

2013
Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains.
Theory Comput. Syst., 2013

Worst-case optimal exploration of terrains with obstacles.
Inf. Comput., 2013

The Beachcombers' Problem: Walking and Searching with Mobile Robots
CoRR, 2013

Optimal patrolling of fragmented boundaries.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Localization for a System of Colliding Robots.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Choosing the best among peers.
Theor. Comput. Sci., 2012

More efficient periodic traversal in anonymous undirected graphs.
Theor. Comput. Sci., 2012

How to meet asynchronously (almost) everywhere.
ACM Trans. Algorithms, 2012

How to meet when you forget: log-space rendezvous in arbitrary graphs.
Distributed Computing, 2012

Position Discovery for a System of Bouncing Robots.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Collecting Information by Power-Aware Mobile Agents.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Time vs. space trade-offs for rendezvous in trees.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Tree Exploration by a Swarm of Mobile Agents.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011
Consensus and Mutual Exclusion in a Multiple Access Channel.
IEEE Trans. Parallel Distrib. Syst., 2011

Asynchronous deterministic rendezvous in bounded terrains.
Theor. Comput. Sci., 2011

Local 7-coloring for planar subgraphs of unit disk graphs.
Theor. Comput. Sci., 2011

Approximation Algorithms for Buy-at-Bulk Geometric Network Design.
Int. J. Found. Comput. Sci., 2011

Optimality and competitiveness of exploring polygons by mobile robots.
Inf. Comput., 2011

Synchronous Rendezvous for Location-Aware Agents.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds.
Proceedings of the Algorithms - ESA 2011, 2011

2010
How to meet asynchronously (almost) everywhere
CoRR, 2010

Asynchronous deterministic rendezvous in bounded terrains
CoRR, 2010

Optimal Exploration of Terrains with Obstacles
CoRR, 2010

Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Optimal Exploration of Terrains with Obstacles.
Proceedings of the Algorithm Theory, 2010

How to Meet Asynchronously (Almost) Everywhere.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Asynchronous Deterministic Rendezvous in Bounded Terrains.
Proceedings of the Structural Information and Communication Complexity, 2010

How to meet when you forget: log-space rendezvous in arbitrary graphs.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Tell Me Where I Am So I Can Meet You Sooner.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Efficient Information Exchange in the Random Phone-Call Model.
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.
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 9th International Conference, 2010

2009
Gathering few fat mobile robots in the plane.
Theor. Comput. Sci., 2009

Local edge colouring of Yao-like subgraphs of Unit Disk Graphs.
Theor. Comput. Sci., 2009

More efficient periodic traversal in anonymous undirected graphs
CoRR, 2009

Consensus and Mutual Exclusion in a Multiple Access Channel.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Approximation Algorithms for Buy-at-Bulk Geometric Network Design.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Black Hole Search in Directed Graphs.
Proceedings of the Structural Information and Communication Complexity, 2009

More Efficient Periodic Traversal in Anonymous Undirected Graphs.
Proceedings of the Structural Information and Communication Complexity, 2009

Optimality and Competitiveness of Exploring Polygons by Mobile Robots.
Proceedings of the Algorithms, 2009

On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment.
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, 2009

2008
Computing the throughput of Concatenation State Machines.
J. Discrete Algorithms, 2008

Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2008

The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring.
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.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Equivalence of simple functions.
Theor. Comput. Sci., 2007

Simultaneous diagonal flips in plane triangulations.
Journal of Graph Theory, 2007

Reducing Simple Grammars: Exponential against Highly-Polynomial Time in Practice.
Int. J. Found. Comput. Sci., 2007

Searching for a Black Hole in Synchronous Tree Networks.
Combinatorics, Probability & Computing, 2007

Assigning Bookmarks in Perfect Binary Trees.
Ars Comb., 2007

Efficient Computation of Throughput Values of Context-Free Languages.
Proceedings of the Implementation and Application of Automata, 2007

Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs.
Proceedings of the Structural Information and Communication Complexity, 2007

2006
Prime normal form and equivalence of simple grammars.
Theor. Comput. Sci., 2006

Complexity of Searching for a Black Hole.
Fundam. Inform., 2006

Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice.
Proceedings of the Implementation and Application of Automata, 2006

Simultaneous diagonal flips in plane triangulations.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Gathering Few Fat Mobile Robots in the Plane.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Equivalence of Functions Represented by Simple Context-Free Grammars with Output.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
Transducers with Set Output.
Journal of Automata, Languages and Combinatorics, 2005

Simultaneous Diagonal Flips in Plane Triangulations
CoRR, 2005

Prime Normal Form and Equivalence of Simple Grammars.
Proceedings of the Implementation and Application of Automata, 2005

2004
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing.
J. Graph Algorithms Appl., 2004

Searching for a Black Hole in Tree Networks.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

2003
Enhancing Hyperlink Structure for Improving Web Performance.
J. Web Eng., 2003

Linear-Time Prime Decomposition Of Regular Prefix Codes.
Int. J. Found. Comput. Sci., 2003

2002
Prime Decompositions of Regular Prefix Codes.
Proceedings of the Implementation and Application of Automata, 2002

Transducers with Set Output.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
Circular Separability of Polygons.
Algorithmica, 2001

2000
Computing Largest Circles Separating Two Sets of Segments.
Int. J. Comput. Geometry Appl., 2000

Strategies for Hotlink Assignments.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Guarding the Convex Subsets of a Point-set.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

Flipping your Lid.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Immobilizing a Shape.
Int. J. Comput. Geometry Appl., 1999

Circular Separability of Polygons
CoRR, 1999

Computing largest circles separating two sets of segments
CoRR, 1999

Convex Tours of Bounded Curvature
CoRR, 1999

Convex tours of bounded curvature.
Comput. Geom., 1999

Dissections, cuts and triangulations.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

Domino tilings of orthogonal polygons.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

Near optimal-partitioning of rectangles and prisms.
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.
Inf. Process. Lett., 1998

Algorithms for Packing Two Circles in a Convex Polygon.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Polygon Cutting: Revisited.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Optimal Floodlight Illumination of Stages.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

On measuring areas of polygons.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Illuminating triangles and quadrilaterals with vertex floodlights.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Cutting rectangles in equal area pieces.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm.
Int. J. Comput. Geometry Appl., 1997

Discrete Realizations of Contact and Intersection Graphs.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Domino tilings and two-by-two squares.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996
On a Problem of Immobilizing Polygons.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

Maximal Length Common Non-intersecting Paths.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

Computing Largest Circles Separating Two Sets of Segments.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
On illuminating line segments in the plane.
Discrete Mathematics, 1995

Circular Separability of Polygon.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994
Protecting convex sets.
Graphs and Combinatorics, 1994

Searching with Local Constraints on Error Patterns.
Eur. J. Comb., 1994

Separation of Convex Sets.
Discrete Applied Mathematics, 1994

Guarding rectangular art galleries.
Discrete Applied Mathematics, 1994

Separating Translates in the Plane: Combinatorial Bounds and an Algorithm.
Proceedings of the Algorithm Theory, 1994

Convex Tours on Bounded Curvature.
Proceedings of the Algorithms, 1994

K-Guarding Polygons on the Plane.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
Illuminating Rectangles and Triangles in the Plane.
J. Comb. Theory, Ser. B, 1993

Optimal Floodlight Illumination of Stages.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
Computing shortest transversals of sets.
Int. J. Comput. Geometry Appl., 1992

Separating Convex Sets in the Plane.
Discrete & Computational Geometry, 1992

1991
Lattice diagrams with few slopes.
J. Comb. Theory, Ser. A, 1991

Searching with a Forbidden Lie Pattern in Responses.
Inf. Process. Lett., 1991

Tight Bounds for the Rectangualr Art Gallery Problem.
Proceedings of the 17th International Workshop, 1991

Immobilizing a Polytope.
Proceedings of the Algorithms and Data Structures, 1991

The Aquarium Keeper's Problem.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Computing Shortest Transversals of Sets (Extended Abstract).
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
Drawing orders with few slopes.
Discrete Mathematics, 1990

1989
Ulam's searching game with lies.
J. Comb. Theory, Ser. A, 1989

Galleries, Light Matchings and Visibility Graphs.
Proceedings of the Algorithms and Data Structures, 1989

1988
Solution of Ulam's problem on binary search with two lies.
J. Comb. Theory, Ser. A, 1988

1985
Implementing generic types in Modula-2.
SIGPLAN Notices, 1985


  Loading...