Jan van Leeuwen

Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen: Integer Representations of Convex Polygon Intersection Graphs. SIAM J. Discrete Math. 27(1): 205-231 (2013)

Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst, Jan van Leeuwen, Frits C. R. Spieksma: Computer-assisted proof of performance ratios for the Differencing Method. Discrete Optimization 9(1): 1-16 (2012)

Erik Jan van Leeuwen, Jan van Leeuwen: Structure of Polynomial-Time Approximation. Theory Comput. Syst. 50(4): 641-674 (2012)

Jan van Leeuwen, Jirí Wiedermann: Computation as an unbounded process. Theor. Comput. Sci. 429: 202-212 (2012)

Jan van Leeuwen, Jirí Wiedermann: Name Resolution by Rewriting in Dynamic Networks of Mobile Entities. Rainbow of Computer Science 2011: 215-227

Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen: Integer representations of convex polygon intersection graphs. Symposium on Computational Geometry 2011: 300-307

Erik Jan van Leeuwen, Jan van Leeuwen: Convex Polygon Intersection Graphs. Graph Drawing 2010: 377-388

Jan van Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe (Eds.): SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings. Lecture Notes in Computer Science 5901, Springer 2010, isbn 978-3-642-11265-2

Bertrand Meyer, Christine Choppy, Jørgen Staunstrup, Jan van Leeuwen: Viewpoint - Research evaluation for computer science. Commun. ACM 52(4): 31-34 (2009)

Jirí Wiedermann, Jan van Leeuwen: How We Think of Computing Today. CiE 2008: 579-593

Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, Jan van Leeuwen: Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. SWAT 2008: 102-113

Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen: Performance ratios of the Karmarkar-Karp differencing method. J. Comb. Optim. 13(1): 19-32 (2007)

Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, Frantisek Plasil (Eds.): SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings. Lecture Notes in Computer Science 4362, Springer 2007, isbn 978-3-540-69506-6

Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, Frantisek Plasil, Mária Bieliková (Eds.): SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings Volume II. Institute of Computer Science AS CR, Prague 2007, isbn 80-903298-9-6

Fernando Orejas, Jan van Leeuwen: Preface: Automata, Languages and Programming . Theor. Comput. Sci. 331(1): 1-2 (2005)

Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen: Approximations for lambda-Colorings of Graphs. Comput. J. 47(2): 193-204 (2004)

Peter Verbaan, Jan van Leeuwen, Jirí Wiedermann: Complexity of Evolving Interactive Systems. Theory Is Forever 2004: 268-281

Hans L. Bodlaender, Richard B. Tan, Jan van Leeuwen: Finding a bigtriangleup-regular supergraph of minimum order. Discrete Applied Mathematics 131(1): 3-9 (2003)

Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen: Performance Ratios for the Karmarkar-Karp Differencing Method. Electronic Notes in Discrete Mathematics 13: 71-75 (2003)

Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen: Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem. STACS 2003: 583-595

Jirí Wiedermann, Jan van Leeuwen: The emergent computational potential of evolving artificial living systems. AI Commun. 15(4): 205-215 (2002)

Jirí Wiedermann, Jan van Leeuwen: Relativistic Computers and Non-uniform Complexity Theory. UMC 2002: 287-299

Jirí Wiedermann, Jan van Leeuwen: Emergence of a Super-Turing Computational Potential in Artificial Living Systems. ECAL 2001: 55-65

Jan van Leeuwen, Jirí Wiedermann: Beyond the Turing Limit: Evolving Interactive Systems. SOFSEM 2001: 90-109

Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (Eds.): Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings. Lecture Notes in Computer Science 2076, Springer 2001, isbn 3-540-42287-0

Jan van Leeuwen, Jirí Wiedermann: On the Power of Interactive Computing. IFIP TCS 2000: 619-623

Jan van Leeuwen, Jirí Wiedermann: On Algorithms and Interaction. MFCS 2000: 99-113

Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen: lambda-Coloring of Graphs. STACS 2000: 395-406

Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito (Eds.): Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings. Lecture Notes in Computer Science 1872, Springer 2000, isbn 3-540-67823-9

Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela: The Complexity of Interval Routing on Random Graphs. Comput. J. 41(1): 16-25 (1998)

Hans L. Bodlaender, Jan van Leeuwen, Richard B. Tan, Dimitrios M. Thilikos: On Interval Routing Schemes and Treewidth. Inf. Comput. 139(1): 92-109 (1997)

Jan van Leeuwen (Ed.): Computer Science Today: Recent Trends and Developments. Lecture Notes in Computer Science 1000, Springer 1995, isbn 3-540-60105-8

Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela: The Complexity of Interval Routing on Random Graphs. MFCS 1995: 37-49

Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen: On Interval Routing Schemes and Treewidth. WG 1995: 181-196

Jan van Leeuwen, Richard B. Tan: Compact Routing Methods: A Survey. SIROCCO 1994: 99-110

Jan van Leeuwen (Ed.): Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings. Lecture Notes in Computer Science 855, Springer 1994, isbn 3-540-58434-X

Jan van Leeuwen (Ed.): Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings. Lecture Notes in Computer Science 790, Springer 1994, isbn 3-540-57899-4

Jan van Leeuwen, Derick Wood: Interval Heaps. Comput. J. 36(3): 209-216 (1993)

Erwin M. Bakker, Jan van Leeuwen, Richard B. Tan: Prefix Routing Schemes in Dynamic Networks. Computer Networks and ISDN Systems 26(4): 403-421 (1993)

Johannes A. La Poutré, Jan van Leeuwen, Mark H. Overmars: Maintenance of 2- and 3-edge- connected components of graphs I. Discrete Mathematics 114(1-3): 329-359 (1993)

Erwin M. Bakker, Jan van Leeuwen: Uniform d-emulations of rings, with an application to distributed virtual ring construction. Networks 23(4): 237-248 (1993)

Jan van Leeuwen (Ed.): Algorithms, Software, Architecture - Information Processing '92, Volume 1, Proceedings of the IFIP 12th World Computer Congress, Madrid, Spain, 7-11 September 1992. IFIP Transactions A-12, North-Holland 1992, isbn 0-444-89747-X

Peter M. W. Knijnenburg, Jan van Leeuwen: On Models for Propositional Dynamic Logic. Theor. Comput. Sci. 91(2): 181-203 (1991)

Emile H. L. Aarts, Jan van Leeuwen, Martin Rem (Eds.): PARLE '91: Parallel Architectures and Languages Europe, Volume I: Parallel Architectures and Algorithms, Eindhoven, The Netherlands, June 10-13, 1991, Proceedings. Lecture Notes in Computer Science 505, Springer 1991, isbn 3-540-54151-9

Emile H. L. Aarts, Jan van Leeuwen, Martin Rem (Eds.): PARLE '91: Parallel Architectures and Languages Europe, Volume II: Parallel Languages, Eindhoven, The Netherlands, June 10-13, 1991, Proceedings. Lecture Notes in Computer Science 506, Springer 1991, isbn 3-540-54152-7

Jan van Leeuwen, Nicola Santoro (Eds.): Distributed Algorithms, 4th International Workshop, WDAG '90, Bari, Italy, September 24-26, 1990, Proceedings. Lecture Notes in Computer Science 486, Springer 1991, isbn 3-540-54099-7

Jan van Leeuwen (Ed.): Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity. Elsevier and MIT Press 1990, isbn 0-444-88071-2

Jan van Leeuwen (Ed.): Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics. Elsevier and MIT Press 1990, isbn 0-444-88074-7

Hans L. Bodlaender, Peter Gritzmann, Victor Klee, Jan van Leeuwen: Computational complexity of norm-maximization. Combinatorica 10(2): 203-225 (1990)

Goos Kant, Jan van Leeuwen: On special multiples of integers. Bulletin of the EATCS 41: 210-211 (1990)

Jan van Leeuwen: Graph Algorithms. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 525-631

Goos Kant, Jan van Leeuwen: The File Distribution Problem for Processor Networks. SWAT 1990: 48-59

Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks: Efficient Elections in Chordal Ring Networks. Algorithmica 4(3): 437-446 (1989)

Bertha Scholten, Jan van Leeuwen: Structured NC. WADS 1989: 487-498

Jan van Leeuwen (Ed.): Graph-Theoretic Concepts in Computer Science, 14th International Workshop, WG '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings. Lecture Notes in Computer Science 344, Springer 1989, isbn 3-540-50728-0

Marc Bezem, Jan van Leeuwen: On Estimating the Complexity of Logarithmic Decompositions. Inf. Process. Lett. 26(6): 321-324 (1988)

Gerard Tel, Richard B. Tan, Jan van Leeuwen: The Derivation of Graph Marking Algorithms From Distributed Termination Detection Protocols. Sci. Comput. Program. 10(1): 107-137 (1988)

Jyrki Katajainen, Jan van Leeuwen, Martti Penttonen: Fast Simulation of Turing Machines by Random Access Machines. SIAM J. Comput. 17(1): 77-88 (1988)

Nicolien J. Drost, Jan van Leeuwen: Assertional Verification of a Majority Consensus Algorithm for Concurrency Control in Multiple Copy Databases. Concurrency 1988: 320-334

Jan van Leeuwen (Ed.): Distributed Algorithms, 2nd International Workshop, Amsterdam, The Netherlands, July 8-10, 1987, Proceedings. Lecture Notes in Computer Science 312, Springer 1988, isbn 3-540-19366-9

Jan van Leeuwen, Jirí Wiedermann: Array Processing Machines: An Abstract Model. BIT 27(1): 25-43 (1987)

Jan van Leeuwen, Richard B. Tan: Interval Routing. Comput. J. 30(4): 298-307 (1987)

Jan van Leeuwen, Richard B. Tan: An Improved Upperbound for Distributed Election in Bidirectional Rings of Processors. Distributed Computing 2(3): 149-160 (1987)

Gerard Tel, Jan van Leeuwen: A non-deterministic algorithm and its analysis. Bulletin of the EATCS 33: 100-102 (1987)

Harry A. G. Wijshoff, Jan van Leeuwen: On Linear Skewing Schemes and d-Ordered Vectors. IEEE Trans. Computers 36(2): 233-239 (1987)

Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks: Guessing Games and Distributed Computations in Synchronous Networks. ICALP 1987: 347-356

Gerard Tel, Richard B. Tan, Jan van Leeuwen: The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols. STACS 1987: 445-455

Johannes A. La Poutré, Jan van Leeuwen: Maintenance of Transitive Closures and Transitive Reductions of Graphs. WG 1987: 106-120

Hans L. Bodlaender, Jan van Leeuwen: Simulation of Large Networks on Smaller Networks. Information and Control 71(3): 143-180 (1986)

Jan van Leeuwen: Pragmatic Aspects of Complexity Theory (Panel). IFIP Congress 1986: 5-6

Hans L. Bodlaender, Jan van Leeuwen: New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. STACS 1986: 119-129

Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen: Improved Diameter Bounds for Altered Graphs. WG 1986: 227-236

Marek Karpinski, Jan van Leeuwen: Preface. Information and Control 64(1-3): 1 (1985)

Harry A. G. Wijshoff, Jan van Leeuwen: The Structure of Periodic Storage Schemes for Parallel Memories. IEEE Trans. Computers 34(6): 501-505 (1985)

Jan van Leeuwen, Jirí Wiedermann: Array processing machines. FCT 1985: 257-268

Hans L. Bodlaender, Jan van Leeuwen: Simulation of Large Networks on Smaller Networks. STACS 1985: 47-58

Harry A. G. Wijshoff, Jan van Leeuwen: Arbitrary versus Periodic Storage Schemes and Tessellations of the Plane Using One Type of Polyomino. Information and Control 62(1): 1-25 (1984)

Mark R. Kramer, Jan van Leeuwen: Systolische Berechnungen und VLSI. Informatik Spektrum 7(3): 154-165 (1984)

Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood: Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space. ITA 18(2): 171-183 (1984)

Robert Endre Tarjan, Jan van Leeuwen: Worst-case Analysis of Set Union Algorithms. J. ACM 31(2): 245-281 (1984)

Jan van Leeuwen, Harry A. G. Wijshoff: Data Mappings in Large Parallel Computers. GI Jahrestagung 1983: 8-20

Mark R. Kramer, Jan van Leeuwen: The VLSI complexity of Boolean functions. Logic and Machines 1983: 397-407

Harry A. G. Wijshoff, Jan van Leeuwen: Periodic versus arbitrary tessellations of the plane using polyominos of a single type. Theoretical Computer Science 1983: 353-366

Mark H. Overmars, Jan van Leeuwen: Dynamic Multi-Dimensional Data Structures Based on Quad- and K - D Trees. Acta Inf. 17: 267-285 (1982)

Jan van Leeuwen, Mark H. Overmars: Stratified Balanced Search Trees. Acta Inf. 18: 345-359 (1982)

Jan van Leeuwen, Maurice Nivat: Efficient Recognition of Rational Relations. Inf. Process. Lett. 14(1): 34-38 (1982)

Mark H. Overmars, Jan van Leeuwen: Some Principles for Dynamizing Decomposable Searching Problems. Inf. Process. Lett. 12(1): 49-53 (1981)

Mark H. Overmars, Jan van Leeuwen: Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems. Inf. Process. Lett. 12(4): 168-173 (1981)

Jan van Leeuwen, Derick Wood: The Measure Problem for Rectangular Ranges in d-Space. J. Algorithms 2(3): 282-300 (1981)

Mark H. Overmars, Jan van Leeuwen: Maintenance of Configurations in the Plane. J. Comput. Syst. Sci. 23(2): 166-204 (1981)

Jan van Leeuwen, Mark H. Overmars: The Art of Dynamizing. MFCS 1981: 121-131

Mark H. Overmars, Jan van Leeuwen: Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds. Theoretical Computer Science 1981: 224-233

Jan van Leeuwen: Über Programmeffizienz und algebraische Komplexität. Informatik Spektrum 3(3): 172-180 (1980)

Jan van Leeuwen, Derick Wood: Dynamization of Decomposable Searching Problems. Inf. Process. Lett. 10(2): 51-56 (1980)

Mark H. Overmars, Jan van Leeuwen: Further Comments on Bykat's Convex Hull Algorithm. Inf. Process. Lett. 10(4/5): 209-212 (1980)

Joost Engelfriet, Erik Meineche Schmidt, Jan van Leeuwen: Stack Machines and Classes of Nonnested Macro Languages. J. ACM 27(1): 96-117 (1980)

Mark H. Overmars, Jan van Leeuwen: Dynamically Maintaining Configurations in the Plane (Detailed Abstract). STOC 1980: 135-145

J. W. de Bakker, Jan van Leeuwen (Eds.): Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout, The Netherland, July 14-18, 1980, Proceedings. Lecture Notes in Computer Science 85, Springer 1980, isbn 3-540-10003-2

Jan van Leeuwen: A Useful Lemma for Context-Free Programmed Grammars. Acta Inf. 11: 373-386 (1979)

Nicholas V. Findler, Jan van Leeuwen: On the Complexity of Decision Trees, the Quasi-Optimizer, and the Power of Heuristic rules. Information and Control 40(1): 1-19 (1979)

Jan van Leeuwen: On Compromising Statistical Data-Bases with a few Known Elements. Inf. Process. Lett. 8(3): 149-153 (1979)

Helmut Alt, Jan van Leeuwen: The complexity of complex division (extended abstract). FCT 1979: 13-17

Peter van Emde Boas, Jan van Leeuwen: Move Rules and Trade-Offs in the Pebble Game. Theoretical Computer Science 1979: 101-112

David P. Dobkin, Jan van Leeuwen: The Complexity of Vector-Products. Inf. Process. Lett. 4(6): 149-154 (1976)

Robert M. Baer, Jan van Leeuwen: The Halting Problem for Linear Turing Assemblers. J. Comput. Syst. Sci. 13(2): 119-135 (1976)

Jan van Leeuwen, Derick Wood: A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families. Theor. Comput. Sci. 1(3): 199-214 (1976)

Jan van Leeuwen: Variations of a New Machine Model. FOCS 1976: 228-235

Jan van Leeuwen: On the Construction of Huffman Trees. ICALP 1976: 382-410

Jan van Leeuwen: The Membership Question for ET0L-Languages is Polynomially Complete. Inf. Process. Lett. 3(5): 138-143 (1975)

Jan van Leeuwen: The Tape-Complexity of Context-Independent Developmental Languages. J. Comput. Syst. Sci. 11(2): 203-211 (1975)

Jan van Leeuwen, Carl H. Smith: An Improved Bound for Detecting Looping Configurations in Deterministic DPA's. Inf. Process. Lett. 3(1): 22-24 (1974)

Jan van Leeuwen: Notes on Pre-Set Pushdown Automata. L Systems 1974: 177-188

Jan van Leeuwen: A Generalisation of Parikh's Theorem in Formal Language Theory. ICALP 1974: 17-26

Jan van Leeuwen: A Partial Solution to the Reachability-Problem for Vector-Addition Systems. STOC 1974: 303-309