| 2013 | ||
|---|---|---|
| j43 | Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc: Worst-case optimal exploration of terrains with obstacles. Inf. Comput. 225: 16-28 (2013) | |
| j42 | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc: Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. Theory Comput. Syst. 52(2): 179-199 (2013) | |
| i9 | Jurek Czyzowicz, Leszek Gasieniec, Konstantinos Georgiou, Evangelos Kranakis, Fraser MacQuarrie: The Beachcombers' Problem: Walking and Searching with Mobile Robots. CoRR abs/1304.7693 (2013) | |
| 2012 | ||
| j41 | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distributed Computing 25(2): 165-178 (2012) | |
| j40 | Jurek Czyzowicz, Andrzej Pelc, Arnaud Labourel: How to meet asynchronously (almost) everywhere. ACM Transactions on Algorithms 8(4): 37 (2012) | |
| j39 | Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc: Choosing the best among peers. Theor. Comput. Sci. 440-441: 52-59 (2012) | |
| j38 | Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane, Wing-Kin Sung: More efficient periodic traversal in anonymous undirected graphs. Theor. Comput. Sci. 444: 60-76 (2012) | |
| c60 | Jurek Czyzowicz, Andrzej Pelc, Mélanie Roy: Tree Exploration by a Swarm of Mobile Agents. OPODIS 2012: 121-134 | |
| c59 | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc: Time vs. space trade-offs for rendezvous in trees. SPAA 2012: 1-10 | |
| c58 | Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès: Collecting Information by Power-Aware Mobile Agents. DISC 2012: 46-60 | |
| c57 | Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Oscar Morales Ponce, Eduardo Pacheco: Position Discovery for a System of Bouncing Robots. DISC 2012: 341-355 | |
| 2011 | ||
| j37 | Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc: Optimality and competitiveness of exploring polygons by mobile robots. Inf. Comput. 209(1): 74-88 (2011) | |
| j36 | Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski: Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Int. J. Found. Comput. Sci. 22(8): 1949-1969 (2011) | |
| j35 | Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Local 7-coloring for planar subgraphs of unit disk graphs. Theor. Comput. Sci. 412(18): 1696-1704 (2011) | |
| j34 | Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc: Asynchronous deterministic rendezvous in bounded terrains. Theor. Comput. Sci. 412(50): 6926-6937 (2011) | |
| j33 | Jurek Czyzowicz, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc: Consensus and Mutual Exclusion in a Multiple Access Channel. IEEE Trans. Parallel Distrib. Syst. 22(7): 1092-1104 (2011) | |
| c56 | Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis: Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds. ESA 2011: 701-712 | |
| c55 | Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Russell A. Martin: Synchronous Rendezvous for Location-Aware Agents. DISC 2011: 447-459 | |
| 2010 | ||
| c54 | Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani: On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. ADHOC-NOW 2010: 29-42 | |
| c53 | Petra Berenbrink, Jurek Czyzowicz, Robert Elsässer, Leszek Gasieniec: Efficient Information Exchange in the Random Phone-Call Model. ICALP (2) 2010: 127-138 | |
| c52 | Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Arnaud Labourel: Tell Me Where I Am So I Can Meet You Sooner. ICALP (2) 2010: 502-514 | |
| c51 | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc: Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. MFCS 2010: 294-305 | |
| c50 | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc: How to meet when you forget: log-space rendezvous in arbitrary graphs. PODC 2010: 450-459 | |
| c49 | Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc: Asynchronous Deterministic Rendezvous in Bounded Terrains. SIROCCO 2010: 72-85 | |
| c48 | Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc: How to Meet Asynchronously (Almost) Everywhere. SODA 2010: 22-30 | |
| c47 | Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc: Optimal Exploration of Terrains with Obstacles. SWAT 2010: 1-12 | |
| c46 | Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Arnaud Labourel: Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. DISC 2010: 297-311 | |
| i8 | Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc: Optimal Exploration of Terrains with Obstacles. CoRR abs/1001.0639 (2010) | |
| i7 | Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc: Asynchronous deterministic rendezvous in bounded terrains. CoRR abs/1001.0889 (2010) | |
| i6 | Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc: How to meet asynchronously (almost) everywhere. CoRR abs/1001.0890 (2010) | |
| 2009 | ||
| j32 | Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc: Gathering few fat mobile robots in the plane. Theor. Comput. Sci. 410(6-7): 481-499 (2009) | |
| j31 | Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Julià Urrutia: Local edge colouring of Yao-like subgraphs of Unit Disk Graphs. Theor. Comput. Sci. 410(14): 1388-1400 (2009) | |
| c45 | Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani: On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. ADHOC-NOW 2009: 194-212 | |
| c44 | Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc: Optimality and Competitiveness of Exploring Polygons by Mobile Robots. ESA 2009: 263-274 | |
| c43 | Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung: More Efficient Periodic Traversal in Anonymous Undirected Graphs. SIROCCO 2009: 167-181 | |
| c42 | Jurek Czyzowicz, Stefan Dobrev, Rastislav Královic, Stanislav Miklík, Dana Pardubská: Black Hole Search in Directed Graphs. SIROCCO 2009: 182-194 | |
| c41 | Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski: Approximation Algorithms for Buy-at-Bulk Geometric Network Design. WADS 2009: 168-180 | |
| c40 | Jurek Czyzowicz, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc: Consensus and Mutual Exclusion in a Multiple Access Channel. DISC 2009: 512-526 | |
| i5 | Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung: More efficient periodic traversal in anonymous undirected graphs. CoRR abs/0905.1737 (2009) | |
| 2008 | ||
| j30 | Jurek Czyzowicz, Wojciech Fraczak, Mohammadreza Yazdani: Computing the throughput of Concatenation State Machines. J. Discrete Algorithms 6(1): 28-36 (2008) | |
| c39 | Jurek Czyzowicz, Stefan Dobrev, Thomas Fevens, Hernán González-Aguilar, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia: Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes. LATIN 2008: 158-169 | |
| c38 | Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Danny Krizanc: The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring. SOFSEM 2008: 234-246 | |
| c37 | Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. TAMC 2008: 170-181 | |
| 2007 | ||
| j29 | Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Miguel Vargas Martin: Assigning Bookmarks in Perfect Binary Trees. Ars Comb. 82 (2007) | |
| j28 | Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc: Searching for a Black Hole in Synchronous Tree Networks. Combinatorics, Probability & Computing 16(4): 595-619 (2007) | |
| j27 | Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter: Reducing Simple Grammars: Exponential against Highly-Polynomial Time in Practice. Int. J. Found. Comput. Sci. 18(4): 715-725 (2007) | |
| j26 | Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood: Simultaneous diagonal flips in plane triangulations. Journal of Graph Theory 54(4): 307-330 (2007) | |
| j25 | Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter: Equivalence of simple functions. Theor. Comput. Sci. 376(1-2): 42-51 (2007) | |
| c36 | Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia: Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs. SIROCCO 2007: 195-207 | |
| c35 | Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter: Efficient Computation of Throughput Values of Context-Free Languages. CIAA 2007: 203-213 | |
| 2006 | ||
| j24 | Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc: Complexity of Searching for a Black Hole. Fundam. Inform. 71(2-3): 229-242 (2006) | |
| j23 | Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter: Prime normal form and equivalence of simple grammars. Theor. Comput. Sci. 363(2): 124-134 (2006) | |
| c34 | Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter: Equivalence of Functions Represented by Simple Context-Free Grammars with Output. Developments in Language Theory 2006: 71-82 | |
| c33 | Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc: Gathering Few Fat Mobile Robots in the Plane. OPODIS 2006: 350-364 | |
| c32 | Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood: Simultaneous diagonal flips in plane triangulations. SODA 2006: 212-221 | |
| c31 | Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter: Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice. CIAA 2006: 90-101 | |
| 2005 | ||
| j22 | Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc: Transducers with Set Output. Journal of Automata, Languages and Combinatorics 10(1): 37-49 (2005) | |
| c30 | Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter: Prime Normal Form and Equivalence of Simple Grammars. CIAA 2005: 78-89 | |
| i4 | Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood: Simultaneous Diagonal Flips in Plane Triangulations. CoRR abs/math/0509478 (2005) | |
| 2004 | ||
| j21 | Prosenjit Bose, Jurek Czyzowicz, Pat Morin, David R. Wood: The Maximum Number of Edges in a Three-Dimensional Grid-Drawing. J. Graph Algorithms Appl. 8: 21-26 (2004) | |
| c29 | Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc: Searching for a Black Hole in Tree Networks. OPODIS 2004: 67-80 | |
| 2003 | ||
| j20 | Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter: Linear-Time Prime Decomposition Of Regular Prefix Codes. Int. J. Found. Comput. Sci. 14(6): 1019-1032 (2003) | |
| j19 | Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Mogiel V. Martin: Enhancing Hyperlink Structure for Improving Web Performance. J. Web Eng. 1(2): 93-127 (2003) | |
| 2002 | ||
| c28 | ||
| c27 | Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter: Prime Decompositions of Regular Prefix Codes. CIAA 2002: 85-94 | |
| 2001 | ||
| j18 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec: Circular Separability of Polygons. Algorithmica 30(1): 67-82 (2001) | |
| 2000 | ||
| j17 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec: Computing Largest Circles Separating Two Sets of Segments. Int. J. Comput. Geometry Appl. 10(1): 41-53 (2000) | |
| c26 | Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin: Flipping your Lid. CCCG 2000 | |
| c25 | Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia: Guarding the Convex Subsets of a Point-set. CCCG 2000 | |
| c24 | Prosenjit Bose, Evangelos Kranakis, Danny Krizanc, Miguel Vargas Martin, Jurek Czyzowicz, Andrzej Pelc, Leszek Gasieniec: Strategies for Hotlink Assignments. ISAAC 2000: 23-34 | |
| 1999 | ||
| j16 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec: Convex tours of bounded curvature. Comput. Geom. 13(3): 149-159 (1999) | |
| j15 | Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia: Immobilizing a Shape. Int. J. Comput. Geometry Appl. 9(2): 181-206 (1999) | |
| c23 | Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Dominic Lessard: Near optimal-partitioning of rectangles and prisms. CCCG 1999 | |
| c22 | György Csizmadia, Jurek Czyzowicz, Leszek Gasieniec, Evangelos Kranakis, Jorge Urrutia: Domino tilings of orthogonal polygons. CCCG 1999 | |
| c21 | ||
| i3 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec: Convex Tours of Bounded Curvature. CoRR cs.CG/9909004 (1999) | |
| i2 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec: Computing largest circles separating two sets of segments. CoRR cs.CG/9909005 (1999) | |
| i1 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec: Circular Separability of Polygons. CoRR cs.CG/9909007 (1999) | |
| 1998 | ||
| j14 | 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. Inf. Process. Lett. 66(3): 125-126 (1998) | |
| c20 | Prosenjit Bose, Jurek Czyzowicz, Dominic Lessard: Cutting rectangles in equal area pieces. CCCG 1998 | |
| c19 | Felipe Contreras, Jurek Czyzowicz, Nicolas Fraiji, Jorge Urrutia: Illuminating triangles and quadrilaterals with vertex floodlights. CCCG 1998 | |
| c18 | ||
| c17 | Felipe Contreras, Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia: Optimal Floodlight Illumination of Stages. Symposium on Computational Geometry 1998: 409-410 | |
| c16 | Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari: Polygon Cutting: Revisited. JCDCG 1998: 81-92 | |
| c15 | Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari: Algorithms for Packing Two Circles in a Convex Polygon. JCDCG 1998: 93-103 | |
| 1997 | ||
| j13 | Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert: Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. Int. J. Comput. Geometry Appl. 7(6): 551-562 (1997) | |
| c14 | Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia: Domino tilings and two-by-two squares. CCCG 1997 | |
| c13 | Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia: Discrete Realizations of Contact and Intersection Graphs. Graph Drawing 1997: 359-370 | |
| 1996 | ||
| c12 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec: Computing Largest Circles Separating Two Sets of Segments. CCCG 1996: 173-178 | |
| c11 | Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia: Maximal Length Common Non-intersecting Paths. CCCG 1996: 185-189 | |
| c10 | Jurek Czyzowicz, Ivan Stojmenovic, Tomasz Szymacha: On a Problem of Immobilizing Polygons. CCCG 1996: 283-288 | |
| 1995 | ||
| j12 | Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks: On illuminating line segments in the plane. Discrete Mathematics 137(1-3): 147-153 (1995) | |
| c9 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec: Circular Separability of Polygon. SODA 1995: 273-281 | |
| 1994 | ||
| j11 | Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks: Guarding rectangular art galleries. Discrete Applied Mathematics 50(2): 149-157 (1994) | |
| j10 | Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia: Separation of Convex Sets. Discrete Applied Mathematics 51(3): 325-328 (1994) | |
| j9 | Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc: Searching with Local Constraints on Error Patterns. Eur. J. Comb. 15(3): 217-222 (1994) | |
| j8 | Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks: Protecting convex sets. Graphs and Combinatorics 10(2-4): 311-321 (1994) | |
| c8 | Patrice Belleville, Prosenjit Bose, Jurek Czyzowicz, Jorge Urrutia, Joseph Zaks: K-Guarding Polygons on the Plane. CCCG 1994: 381-386 | |
| c7 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec: Convex Tours on Bounded Curvature. ESA 1994: 254-265 | |
| c6 | Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert: Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. SWAT 1994: 107-118 | |
| 1993 | ||
| j7 | Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia: Illuminating Rectangles and Triangles in the Plane. J. Comb. Theory, Ser. B 57(1): 1-17 (1993) | |
| c5 | Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia: Optimal Floodlight Illumination of Stages. CCCG 1993: 393-398 | |
| 1992 | ||
| j6 | Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia: Separating Convex Sets in the Plane. Discrete & Computational Geometry 7: 189-195 (1992) | |
| 1991 | ||
| j5 | Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc: Searching with a Forbidden Lie Pattern in Responses. Inf. Process. Lett. 37(3): 127-132 (1991) | |
| j4 | ||
| c4 | Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia: Computing Shortest Transversals of Sets (Extended Abstract). Symposium on Computational Geometry 1991: 71-80 | |
| c3 | ||
| c2 | Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks: Tight Bounds for the Rectangualr Art Gallery Problem. WG 1991: 105-112 | |
| 1990 | ||
| j3 | Jurek Czyzowicz, Andrzej Pelc, Ivan Rival: Drawing orders with few slopes. Discrete Mathematics 82(3): 233-250 (1990) | |
| 1989 | ||
| j2 | Jurek Czyzowicz, Daniele Mundici, Andrzej Pelc: Ulam's searching game with lies. J. Comb. Theory, Ser. A 52(1): 62-76 (1989) | |
| c1 | Jurek Czyzowicz, Ivan Rival, Jorge Urrutia: Galleries, Light Matchings and Visibility Graphs. WADS 1989: 316-324 | |
| 1988 | ||
| j1 | Jurek Czyzowicz, Andrzej Pelc, Daniele Mundici: Solution of Ulam's problem on binary search with two lies. J. Comb. Theory, Ser. A 49(2): 384-388 (1988) | |
Data released under the ODC-BY 1.0 license — See also our legal information page