| 2021 | SOFSEM | Towards Minimally Conscious Cyber-Physical Systems: A Manifesto. | Jir Wiedermann, Jan van Leeuwen |
| 2019 | CiE | Finite State Machines with Feedback: An Architecture Supporting Minimal Machine Consciousness. | Jir Wiedermann, Jan van Leeuwen |
| 2015 | SOFSEM | What is Computation: An Epistemic Approach. | Jir Wiedermann, Jan van Leeuwen |
| 2010 | GD | Convex Polygon Intersection Graphs. | Erik Jan van Leeuwen, Jan van Leeuwen |
| 2008 | CiE | How We Think of Computing Today. | Jir Wiedermann, Jan van Leeuwen |
| 2003 | STACS | Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem. | Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen |
| 2001 | SOFSEM | Beyond the Turing Limit: Evolving Interactive Systems. | Jan van Leeuwen, Jir Wiedermann |
| 2000 | MFCS | On Algorithms and Interaction. | Jan van Leeuwen, Jir Wiedermann |
| 2000 | STACS | lambda-Coloring of Graphs. | Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen |
| 1995 | MFCS | The Complexity of Interval Routing on Random Graphs. | Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela |
| 1995 | WG | On Interval Routing Schemes and Treewidth. | Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen |
| 1994 | SIROCCO | Compact Routing Methods: A Survey. | Jan van Leeuwen, Richard B. Tan |
| 1989 | WADS | Structured NC. | Bertha Scholten, Jan van Leeuwen |
| 1988 | CONCUR | Assertional Verification of a Majority Consensus Algorithm for Concurrency Control in Multiple Copy Databases. | Nicolien J. Drost, Jan van Leeuwen |
| 1987 | ICALP | Guessing Games and Distributed Computations in Synchronous Networks. | Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks |
| 1987 | STACS | The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols. | Gerard Tel, Richard B. Tan, Jan van Leeuwen |
| 1987 | WG | Maintenance of Transitive Closures and Transitive Reductions of Graphs. | Johannes A. La Poutr, Jan van Leeuwen |
| 1986 | STACS | New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. | Hans L. Bodlaender, Jan van Leeuwen |
| 1986 | WG | Improved Diameter Bounds for Altered Graphs. | Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen |
| 1985 | FCT | Array processing machines. | Jan van Leeuwen, Jir Wiedermann |
| 1985 | STACS | Simulation of Large Networks on Smaller Networks. | Hans L. Bodlaender, Jan van Leeuwen |
| 1983 | GI | Data Mappings in Large Parallel Computers. | Jan van Leeuwen, Harry A. G. Wijshoff |
| 1981 | MFCS | The Art of Dynamizing. | Jan van Leeuwen, Mark H. Overmars |
| 1981 | WG | Untangling a Travelling Salesman Tour in the Plane. | Jan van Leeuwen, Anneke A. Schoone |
| 1980 | STOC | Dynamically Maintaining Configurations in the Plane (Detailed Abstract) | Mark H. Overmars, Jan van Leeuwen |
| 1979 | FCT | The complexity of complex division (extended abstract). | Helmut Alt, Jan van Leeuwen |
| 1976 | FOCS | Variations of a New Machine Model | Jan van Leeuwen |
| 1976 | ICALP | On the Construction of Huffman Trees. | Jan van Leeuwen |
| 1974 | ICALP | A Generalisation of Parikh's Theorem in Formal Language Theory. | Jan van Leeuwen |
| 1974 | STOC | A Partial Solution to the Reachability-Problem for Vector-Addition Systems | Jan van Leeuwen |