| 2019 | Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node. | Ruben Brokkelkamp, Sven C. Polak, Guido Schfer, Yllka Velaj |
| 2019 | Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. | Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier |
| 2019 | When Maximum Stable Set Can Be Solved in FPT Time. | douard Bonnet, Nicolas Bousquet, Stphan Thomass, Rmi Watrigant |
| 2019 | Top Tree Compression of Tries. | Philip Bille, Pawel Gawrychowski, Inge Li Grtz, Gad M. Landau, Oren Weimann |
| 2019 | Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics. | Marcin Bienkowski, Lukasz Jez, Pawel Schmidt |
| 2019 | Triangle Estimation Using Tripartite Independent Set Queries. | Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra |
| 2019 | The Weighted k-Center Problem in Trees for Fixed k. | Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev |
| 2019 | On One-Round Discrete Voronoi Games. | Mark de Berg, Sndor Kisfaludi-Bak, Mehran Mehr |
| 2019 | Step-By-Step Community Detection in Volume-Regular Graphs. | Luca Becchetti, Emilio Cruciani, Francesco Pasquale, Sara Rizzo |
| 2019 | Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions. | Gill Barequet, Evanthia Papadopoulou, Martin Suderland |
| 2019 | Efficiently Realizing Interval Sequences. | Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz |
| 2019 | The Generalized Microscopic Image Reconstruction Problem. | Amotz Bar-Noy, Toni Bhnlein, Zvi Lotker, David Peleg, Dror Rawitz |
| 2019 | Minimum-Width Double-Strip and Parallelogram Annulus. | Sang Won Bae |
| 2019 | Local Routing in Sparse and Lightweight Geometric Graphs. | Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, Andr van Renssen |
| 2019 | On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. | Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay |
| 2019 | New Results for the k-Secretary Problem. | Susanne Albers, Leon Ladewig |
| 2019 | The k-Frchet Distance: How to Walk Your Dog While Teleporting. | Hugo Alves Akitaya, Maike Buchin, Leonie Ryvkin, Jrme Urhausen |
| 2019 | Distance Measures for Embedded Graphs. | Hugo A. Akitaya, Maike Buchin, Bernhard Kilgus, Stef Sijben, Carola Wenk |
| 2019 | Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. | Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh |
| 2019 | A 21/16-Approximation for the Minimum 3-Path Partition Problem. | Yong Chen, Randy Goebel, Bing Su, Weitian Tong, Yao Xu, An Zhang |
| 2019 | Graph Searches and Their End Vertices. | Yixin Cao, Zhifeng Wang, Guozhen Rong, Jianxin Wang |
| 2019 | Path and Ancestor Queries over Trees with Multidimensional Weight Vectors. | Meng He, Serikzhan Kazi |
| 2018 | Opinion Forming in Erds-Rnyi Random Graph and Expanders. | Ahad N. Zehmakan |
| 2018 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2018 | Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk). | Shang-Hua Teng |