|
Search the dblp DataBase
Jurek Czyzowicz:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin
Flipping your Lid. [Citation Graph (0, 0)][DBLP] CCCG, 2000, pp:- [Conf]
- Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec
Computing Largest Circles Separating Two Sets of Segments. [Citation Graph (0, 0)][DBLP] CCCG, 1996, pp:173-178 [Conf]
- Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Dominic Lessard
Near optimal-partitioning of rectangles and prisms. [Citation Graph (0, 0)][DBLP] CCCG, 1999, pp:- [Conf]
- Prosenjit Bose, Jurek Czyzowicz, Dominic Lessard
Cutting rectangles in equal area pieces. [Citation Graph (0, 0)][DBLP] CCCG, 1998, pp:- [Conf]
- Patrice Belleville, Prosenjit Bose, Jurek Czyzowicz, Jorge Urrutia, Joseph Zaks
K-Guarding Polygons on the Plane. [Citation Graph (0, 0)][DBLP] CCCG, 1994, pp:381-386 [Conf]
- Felipe Contreras, Jurek Czyzowicz, Nicolas Fraiji, Jorge Urrutia
Illuminating triangles and quadrilaterals with vertex floodlights. [Citation Graph (0, 0)][DBLP] CCCG, 1998, pp:- [Conf]
- György Csizmadia, Jurek Czyzowicz, Leszek Gasieniec, Evangelos Kranakis, Jorge Urrutia
Domino tilings of orthogonal polygons. [Citation Graph (0, 0)][DBLP] CCCG, 1999, pp:- [Conf]
- Jurek Czyzowicz, F. Contreras-Alcalá, Jorge Urrutia
On measuring areas of polygons. [Citation Graph (0, 0)][DBLP] CCCG, 1998, pp:- [Conf]
- Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia
Maximal Length Common Non-intersecting Paths. [Citation Graph (0, 0)][DBLP] CCCG, 1996, pp:185-189 [Conf]
- Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia
Guarding the Convex Subsets of a Point-set. [Citation Graph (0, 0)][DBLP] CCCG, 2000, pp:- [Conf]
- Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia
Domino tilings and two-by-two squares. [Citation Graph (0, 0)][DBLP] CCCG, 1997, pp:- [Conf]
- Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia
Dissections, cuts and triangulations. [Citation Graph (0, 0)][DBLP] CCCG, 1999, pp:- [Conf]
- Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia
Optimal Floodlight Illumination of Stages. [Citation Graph (0, 0)][DBLP] CCCG, 1993, pp:393-398 [Conf]
- Jurek Czyzowicz, Ivan Stojmenovic, Tomasz Szymacha
On a Problem of Immobilizing Polygons. [Citation Graph (0, 0)][DBLP] CCCG, 1996, pp:283-288 [Conf]
- Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc
Transducers with Set Output. [Citation Graph (0, 0)][DBLP] COCOON, 2002, pp:300-309 [Conf]
- Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia
Computing Shortest Transversals of Sets (Extended Abstract). [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1991, pp:71-80 [Conf]
- Felipe Contreras, Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia
Optimal Floodlight Illumination of Stages. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1998, pp:409-410 [Conf]
- Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
Equivalence of Functions Represented by Simple Context-Free Grammars with Output. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2006, pp:71-82 [Conf]
- Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec
Convex Tours on Bounded Curvature. [Citation Graph (0, 0)][DBLP] ESA, 1994, pp:254-265 [Conf]
- Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia
Discrete Realizations of Contact and Intersection Graphs. [Citation Graph (0, 0)][DBLP] Graph Drawing, 1997, pp:359-370 [Conf]
- Prosenjit Bose, Evangelos Kranakis, Danny Krizanc, Miguel Vargas Martin, Jurek Czyzowicz, Andrzej Pelc, Leszek Gasieniec
Strategies for Hotlink Assignments. [Citation Graph (0, 0)][DBLP] ISAAC, 2000, pp:23-34 [Conf]
- Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari
Polygon Cutting: Revisited. [Citation Graph (0, 0)][DBLP] JCDCG, 1998, pp:81-92 [Conf]
- Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari
Algorithms for Packing Two Circles in a Convex Polygon. [Citation Graph (0, 0)][DBLP] JCDCG, 1998, pp:93-103 [Conf]
- Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc
Gathering Few Fat Mobile Robots in the Plane. [Citation Graph (0, 0)][DBLP] OPODIS, 2006, pp:350-364 [Conf]
- Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc
Searching for a Black Hole in Tree Networks. [Citation Graph (0, 0)][DBLP] OPODIS, 2004, pp:67-80 [Conf]
- Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec
Circular Separability of Polygon. [Citation Graph (0, 0)][DBLP] SODA, 1995, pp:273-281 [Conf]
- Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood
Simultaneous diagonal flips in plane triangulations. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:212-221 [Conf]
- Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. [Citation Graph (0, 0)][DBLP] SWAT, 1994, pp:107-118 [Conf]
- Jurek Czyzowicz, Ivan Rival, Jorge Urrutia
Galleries, Light Matchings and Visibility Graphs. [Citation Graph (0, 0)][DBLP] WADS, 1989, pp:316-324 [Conf]
- Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia
Immobilizing a Polytope. [Citation Graph (0, 0)][DBLP] WADS, 1991, pp:214-227 [Conf]
- Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks
Tight Bounds for the Rectangualr Art Gallery Problem. [Citation Graph (0, 0)][DBLP] WG, 1991, pp:105-112 [Conf]
- Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
Prime Normal Form and Equivalence of Simple Grammars. [Citation Graph (0, 0)][DBLP] CIAA, 2005, pp:78-89 [Conf]
- Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter
Prime Decompositions of Regular Prefix Codes. [Citation Graph (0, 0)][DBLP] CIAA, 2002, pp:85-94 [Conf]
- Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice. [Citation Graph (0, 0)][DBLP] CIAA, 2006, pp:90-101 [Conf]
- Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec
Circular Separability of Polygons. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:30, n:1, pp:67-82 [Journal]
- Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec
Convex tours of bounded curvature. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1999, v:13, n:3, pp:149-159 [Journal]
- Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec
Convex Tours of Bounded Curvature [Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal]
- Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec
Computing largest circles separating two sets of segments [Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal]
- Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec
Circular Separability of Polygons [Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal]
- Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks
Guarding rectangular art galleries. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:50, n:2, pp:149-157 [Journal]
- Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia
Separation of Convex Sets. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:51, n:3, pp:325-328 [Journal]
- Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia
Separating Convex Sets in the Plane. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1992, v:7, n:, pp:189-195 [Journal]
- Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc
Searching with Local Constraints on Error Patterns. [Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1994, v:15, n:3, pp:217-222 [Journal]
- Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc
Complexity of Searching for a Black Hole. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 2006, v:71, n:2-3, pp:229-242 [Journal]
- Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec
Computing Largest Circles Separating Two Sets of Segments. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2000, v:10, n:1, pp:41-53 [Journal]
- Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1997, v:7, n:6, pp:551-562 [Journal]
- Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia
Immobilizing a Shape. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1999, v:9, n:2, pp:181-0 [Journal]
- Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter
Linear-Time Prime Decomposition Of Regular Prefix Codes. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2003, v:14, n:6, pp:1019-1032 [Journal]
- Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia
A Simple Proof of the Representation of Bipartite Planar Graphs as the Contact Graphs of Orthogonal Straight Line Segments. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:66, n:3, pp:125-126 [Journal]
- Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc
Searching with a Forbidden Lie Pattern in Responses. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1991, v:37, n:3, pp:127-132 [Journal]
- Jurek Czyzowicz
Lattice diagrams with few slopes. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1991, v:56, n:1, pp:96-108 [Journal]
- Jurek Czyzowicz, Daniele Mundici, Andrzej Pelc
Ulam's searching game with lies. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1989, v:52, n:1, pp:62-76 [Journal]
- Jurek Czyzowicz, Andrzej Pelc, Daniele Mundici
Solution of Ulam's problem on binary search with two lies. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1988, v:49, n:2, pp:384-388 [Journal]
- Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia
Illuminating Rectangles and Triangles in the Plane. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1993, v:57, n:1, pp:1-17 [Journal]
- Prosenjit Bose, Jurek Czyzowicz, Pat Morin, David R. Wood
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing. [Citation Graph (0, 0)][DBLP] J. Graph Algorithms Appl., 2004, v:8, n:, pp:21-26 [Journal]
- Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Mogiel V. Martin
Enhancing Hyperlink Structure for Improving Web Performance. [Citation Graph (0, 0)][DBLP] J. Web Eng., 2003, v:1, n:2, pp:93-127 [Journal]
- Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
Prime normal form and equivalence of simple grammars. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:363, n:2, pp:124-134 [Journal]
- Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
Equivalence of simple functions. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:376, n:1-2, pp:42-51 [Journal]
- Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood
Simultaneous diagonal flips in plane triangulations. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2007, v:54, n:4, pp:307-330 [Journal]
- Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs. [Citation Graph (0, 0)][DBLP] SIROCCO, 2007, pp:195-207 [Conf]
- Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
Efficient Computation of Throughput Values of Context-Free Languages. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:203-213 [Conf]
- Jurek Czyzowicz, Andrzej Pelc, Ivan Rival
Drawing orders with few slopes. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:82, n:3, pp:233-250 [Journal]
- Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks
On illuminating line segments in the plane. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:137, n:1-3, pp:147-153 [Journal]
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. [Citation Graph (, )][DBLP]
On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. [Citation Graph (, )][DBLP]
Optimality and Competitiveness of Exploring Polygons by Mobile Robots. [Citation Graph (, )][DBLP]
Tell Me Where I Am So I Can Meet You Sooner. [Citation Graph (, )][DBLP]
Efficient Information Exchange in the Random Phone-Call Model. [Citation Graph (, )][DBLP]
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes. [Citation Graph (, )][DBLP]
Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. [Citation Graph (, )][DBLP]
How to meet when you forget: log-space rendezvous in arbitrary graphs. [Citation Graph (, )][DBLP]
Black Hole Search in Directed Graphs. [Citation Graph (, )][DBLP]
More Efficient Periodic Traversal in Anonymous Undirected Graphs. [Citation Graph (, )][DBLP]
Asynchronous Deterministic Rendezvous in Bounded Terrains. [Citation Graph (, )][DBLP]
How to Meet Asynchronously (Almost) Everywhere. [Citation Graph (, )][DBLP]
The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring. [Citation Graph (, )][DBLP]
Optimal Exploration of Terrains with Obstacles. [Citation Graph (, )][DBLP]
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. [Citation Graph (, )][DBLP]
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. [Citation Graph (, )][DBLP]
Consensus and Mutual Exclusion in a Multiple Access Channel. [Citation Graph (, )][DBLP]
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. [Citation Graph (, )][DBLP]
Assigning Bookmarks in Perfect Binary Trees. [Citation Graph (, )][DBLP]
Simultaneous Diagonal Flips in Plane Triangulations [Citation Graph (, )][DBLP]
More efficient periodic traversal in anonymous undirected graphs [Citation Graph (, )][DBLP]
Optimal Exploration of Terrains with Obstacles [Citation Graph (, )][DBLP]
Asynchronous deterministic rendezvous in bounded terrains [Citation Graph (, )][DBLP]
How to meet asynchronously (almost) everywhere [Citation Graph (, )][DBLP]
Searching for a Black Hole in Synchronous Tree Networks. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.459secs
|