| 2004 | SIROCCO | Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks. | Flaminia L. Luccio, Jop F. Sibeyn |
| 2003 | ESA | Algorithms and Experiments for the Webgraph. | Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn |
| 2003 | EuroPar | Minimizing Global Communication in Parallel List Ranking. | Jop F. Sibeyn |
| 2002 | EuroPar | Routing and Communication in Interconnection Networks. | Michele Flammini, Bruce M. Maggs, Jop F. Sibeyn, Berthold Vcking |
| 2002 | SPAA | Heuristics for semi-external depth first search on directed graphs. | Jop F. Sibeyn, James Abello, Ulrich Meyer |
| 2001 | EuroPar | Beyond External Computing: Analysis of the Cycle Structure of Permutations. | Jrg Keller, Jop F. Sibeyn |
| 2001 | ICALP | Faster Gossiping on Butterflies. | Jop F. Sibeyn |
| 2000 | EuroPar | A Bandwidth Latency Tradeoff for Broadcast and Reduction. | Peter Sanders, Jop F. Sibeyn |
| 2000 | SIROCCO | A powerful heuristic for telephone gossiping. | Ren Beier, Jop F. Sibeyn |
| 1999 | HiPC | Ultimate Parallel List Ranking? | Jop F. Sibeyn |
| 1999 | STACS | External Selection. | Jop F. Sibeyn |
| 1999 | SIROCCO | Power and Limitations of Optical Reconfigurable Arrays. | Jop F. Sibeyn |
| 1998 | EuroPar | Gossiping Large Packets on Full-Port Tori. | Ulrich Meyer, Jop F. Sibeyn |
| 1997 | CIAC | BSP-Like External-Memory Computation. | Jop F. Sibeyn, Michael Kaufmann |
| 1997 | EuroPar | Routing on the PADAM: Degrees of Optimality. | Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn |
| 1997 | EuroPar | Sample Sort on Meshes. | Jop F. Sibeyn |
| 1997 | MFCS | Routing with Finite Speeds of Memory and Network. | Jop F. Sibeyn |
| 1997 | SPAA | Better Trade-Offs for Parallel List Ranking. | Jop F. Sibeyn |
| 1996 | EuroPar | Worm-Hole Gossiping on Meshes. | Ben H. H. Juurlink, P. S. Rao, Jop F. Sibeyn |
| 1996 | EuroPar | List Ranking on Interconnection Networks. | Jop F. Sibeyn |
| 1996 | MFCS | Routing on Triangles, Tori and Honeycombs. | Jop F. Sibeyn |
| 1995 | ESA | Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes. | Michael Kaufmann, Jop F. Sibeyn, Torsten Suel |
| 1995 | MFCS | Solving Cheap Graph Problems an Meshes. | Jop F. Sibeyn, Michael Kaufmann |
| 1994 | ESA | Desnakification of Mesh Sorting Algorithms. | Jop F. Sibeyn |
| 1994 | MFCS | Shorter Queues for Permutation Routing on Meshes. | Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann |
| 1994 | SODA | Derandomizing Algorithms for Routing and Sorting on Meshes. | Michael Kaufmann, Jop F. Sibeyn, Torsten Suel |
| 1994 | STACS | Deterministic 1-k Routing on Meshes. | Jop F. Sibeyn, Michael Kaufmann |
| 1994 | SPAA | Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer. | Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn |
| 1993 | ESA | Randomized Routing on Meshes with Buses. | Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman |
| 1992 | SPAA | Matching the Bisection Bound for Routing and Sorting on the Mesh. | Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn |