The following pages link to Jurek Czyzowicz (Q203739):
Displayed 50 items.
- Collision-free network exploration (Q2396820) (← links)
- Temporal flows in temporal networks (Q2424668) (← links)
- Lattice diagrams with few slopes (Q2641322) (← links)
- (Q2728846) (← links)
- (Q2728847) (← links)
- (Q2752519) (← links)
- (Q2752520) (← links)
- Survivability of bouncing robots (Q2821106) (← links)
- Linear Search by a Pair of Distinct-Speed Robots (Q2835026) (← links)
- Communication Problems for Mobile Agents Exchanging Energy (Q2835031) (← links)
- Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) (Q2980175) (← links)
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds (Q3092272) (← links)
- Synchronous Rendezvous for Location-Aware Agents (Q3095348) (← links)
- COMPUTING SHORTEST TRANSVERSALS OF SETS (Q3136222) (← links)
- (Q3138983) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- How to meet asynchronously (almost) everywhere (Q3189080) (← links)
- APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Q3224959) (← links)
- God save the queen (Q3305734) (← links)
- (Q3351380) (← links)
- (Q3370007) (← links)
- (Q3386625) (← links)
- More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168) (← links)
- Black Hole Search in Directed Graphs (Q3408170) (← links)
- On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (Q3448801) (← links)
- When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots (Q3459874) (← links)
- Information Spreading by Mobile Particles on a Line (Q3460722) (← links)
- (Q3494327) (← links)
- REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE (Q3503088) (← links)
- Efficient Computation of Throughput Values of Context-Free Languages (Q3503907) (← links)
- Asynchronous Deterministic Rendezvous in Bounded Terrains (Q3569117) (← links)
- Optimal Exploration of Terrains with Obstacles (Q3569874) (← links)
- Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains (Q3586092) (← links)
- Efficient Information Exchange in the Random Phone-Call Model (Q3587433) (← links)
- Tell Me Where I Am So I Can Meet You Sooner (Q3587463) (← links)
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids (Q3588310) (← links)
- Equivalence of Functions Represented by Simple Context-Free Grammars with Output (Q3617047) (← links)
- Optimality and Competitiveness of Exploring Polygons by Mobile Robots (Q3639251) (← links)
- Consensus and Mutual Exclusion in a Multiple Access Channel (Q3646247) (← links)
- (Q4018725) (← links)
- (Q4028896) (← links)
- (Q4037421) (← links)
- Separating Translates in the Plane: Combinatorial Bounds and an Algorithm (Q4375870) (← links)
- (Q4418601) (← links)
- (Q4472476) (← links)
- IMMOBILIZING A SHAPE (Q4513240) (← links)
- (Q4525052) (← links)
- Search on a Line by Byzantine Robots (Q4636509) (← links)
- The Maximum Number of Edges in a Three-Dimensional Grid-Drawing (Q4679078) (← links)
- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS (Q4682203) (← links)