| 2020 | SOFSEM | Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract). | Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke |
| 2019 | FCT | The Fault-Tolerant Metric Dimension of Cographs. | Duygu Vietz, Egon Wanke |
| 2019 | WALCOM | Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components - (Extended Abstract). | Duygu Vietz, Stefan Hoffmann, Egon Wanke |
| 2015 | COCOA | Directed Pathwidth and Palletizers. | Frank Gurski, Jochen Rethmann, Egon Wanke |
| 2012 | Algosensors | Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete. | Stefan Hoffmann, Egon Wanke |
| 2010 | PODC | Brief announcement: complexity and solution of the send-receive correlation problem. | Benito van der Zander, Egon Wanke, Wolfgang Kiess, Bjrn Scheuermann |
| 2009 | WG | On Module-Composed Graphs. | Frank Gurski, Egon Wanke |
| 2007 | WG | The Clique-Width of Tree-Power and Leaf-Power Graphs. | Frank Gurski, Egon Wanke |
| 2005 | WG | Minimizing NLC-Width is NP-Complete. | Frank Gurski, Egon Wanke |
| 2004 | ISAAC | Oriented Paths in Mixed Graphs. | Egon Wanke, Rolf Ktter |
| 2004 | LATIN | Vertex Disjoint Paths on Clique-Width Bounded Graphs. | Frank Gurski, Egon Wanke |
| 2001 | MFCS | A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing. | Wolfgang Espelage, Egon Wanke |
| 2001 | WADS | Deciding Clique-Width for Graphs of Bounded Tree-Width. | Wolfgang Espelage, Frank Gurski, Egon Wanke |
| 2001 | WG | How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. | Wolfgang Espelage, Frank Gurski, Egon Wanke |
| 2000 | SODA | Movement minimization in conveyor flow shop processing. | Wolfgang Espelage, Egon Wanke |
| 2000 | WG | The Tree-Width of Clique-Width Bounded Graphs Without | Frank Gurski, Egon Wanke |
| 1998 | ISAAC | An Optimal Algorithm for On-Line Palletizing at Delivery Industry. | Jochen Rethmann, Egon Wanke |
| 1997 | ESA | Competivive Analysis of on-line Stack-Up Algorithms. | Jochen Rethmann, Egon Wanke |
| 1997 | WADS | An Approximation Algorithm for Stacking up Bins from a Conveyor onto Pallets. | Jochen Rethmann, Egon Wanke |
| 1994 | ICALP | Polynomial Time Analysis of Torodial Periodic Graphs. | Franz Hfting, Egon Wanke |
| 1994 | WG | Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages. | Konstantin Skodinis, Egon Wanke |
| 1993 | MFCS | Paths and Cycles in Finite Periodic Graphs. | Egon Wanke |
| 1993 | SODA | Polynomial Algorithms for Minimum Cost Paths in Periodic Graphs. | Franz Hfting, Egon Wanke |
| 1993 | STACS | 1st Grade - A System for Implementation, Testing and Animation of Graph Algorithms. | Franz Hfting, Egon Wanke, Aurel Balmosan, Curd Bergmann |
| 1993 | WG | Bounded Tree-Width and LOGCFL. | Egon Wanke |
| 1991 | FCT | On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages. | Egon Wanke |
| 1989 | FCT | The Complexity of Connectivity Problems on Context-Free Graph Languages (Extended Abstract). | Egon Wanke |
| 1988 | ICALP | Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract). | Thomas Lengauer, Egon Wanke |
| 1988 | STACS | PLEXUS: A System for Implementing Hierarchical Graph Algorithms. | Egon Wanke |