Conference Program

All the events will be held at Capital Ballroom Center room on the 1st floor of Sheraton Atlanta.



December 14, 2018

Session Time Titles of Talks / Speakers and Authors
Registration 14:00 - 17:00
-
TPC Appreciation Dinner 18:00 - 20:30

December 15, 2018

-
Session Time Titles of Talks / Speakers and Authors
Registration 08:00 – 17:30
Keynote1 09:00 - 10:00 Dr. Blair Sullivan, North Carolina State University, Raleigh, NC, USA
Coffee Break 10:00 - 10:30
Session 1
Graph Theory
(Session Chair: Donghyun Kim)
10:30 - 10:50 Fast approximation of centrality and distances in hyperbolic graphs
V. Chepoi, F.F. Dragan, M. Habib, Y. Vaxès, H. Alrasheed
10:50 - 11:10 Rectilinear Shortest Paths Among Transient Obstacles
Anil Maheshwari, Arash Nouri, and Jörg-Rüdiger Sack
11:10 - 11:30 An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy
Kunihiro Wasa and Takeaki Uno
11:30 - 11:50 Tree t-spanners of a graph: minimizing maximum distances efficiently
Fernanda Couto and Luís Felipe I. Cunha
11:50 - 12:10 On the approximability of Time Disjoint Walks
Alexandre Bayen, Jesse Goodman, and Eugene Vinitsky
Lunch 12:10-13:40
-
Session 2
Network Flow and Security
(Session Chair: Kunihiro Wasa)
13:40 - 14:00 Removing Undesirable Flows by Edge Deletion
Gleb Polevoy, Stojan Trajanovski, Paola Grosso, and Cees de Laat
14:00 - 14:20 Min-Max-Flow based Algorithm for Evacuation Network Planning in Restricted Spaces
Yi Hong, Jiandong Liu, Chuanwen Luo, and Deying Li
14:20 - 14:40 Practical and Easy-to-Understand Card-Based Implementation of Yao's Millionaire Protocol
Daiki Miyahara, Yu-ichi Hayashi, Takaaki Mizuki, and Hideaki Sone
14:40 - 15:00 Defend the Clique-based Attack for Data Privacy
Meng Han, Dongjing Miao, Jinbao Wang, and Liyuan Liu
15:00 - 15:20 Exact Computation of Strongly Connected Reliability by Binary Decision Diagrams
Hirofumi Suzuki, Masakazu Ishihata, and Shin-ichi Minato
Coffee Break 15:20 - 15:50
-
Session 3 Combinatorial Optimization (Session Chair: Barbara Anthony) 15:50 - 16:10 Upper and Lower Bounds for Different Parameterizations of (n,3)-MAXSAT
Tatiana Belova and Ivan Bliznets
16:10 - 16:30 Related Machine Scheduling with Machine Speeds Satisfying Linear Constraints
Siyun Zhang, Kameng Nip, and Zhenbo Wang
16:30 - 16:50 Open-shop scheduling for unit jobs under precedence constraints
An Zhang, Yong Chen, Randy Goebel, and Guohui Lin
16:50 - 17:10 Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments
Daniel R. Page, Roberto Solis-Oba, and Marten Maack
17:10 - 17:30 Super-stability in the Student-Project Allocation Problem with Ties
Sofiat Olaosebikan and David Manlove
Banquet Dinner 18:20 - 21:00
-

December 16, 2018

Session Time Titles of Talks / Speakers and Authors
Registration 08:00 – 17:20
-
Keynote2 08:30 - 09:30 Dr. Bruce Maggs, Duke University, Durham, NC, USA
Coffee Break 09:30 - 10:00
-
Session 4
Combinatorial Optimization
(Session Chair: Ovidiu Daescu)
10:00 - 10:20 Primal Dual Algorithm for Partial Set Multi-Cover
Yingli Ran, Yishuo Shi, and Zhao Zhang
10:20 - 10:40 Reducing Extension Edges of Concurrent Programs for Reachability Analysis
Cong Tian, Jiaying Wang, Zhenhua Duan, and Liang Zhao
10:40 - 11:00 Robustly Assigning Unstable Items
Ananya Christman, Christine Chung, Nicholas Jaczko, and Scott Westvold
11:00 - 11:20 Approximability and Hardness of Discrete Packing and Domination Problems
Raghunath Reddy Madireddy, Apurva Mudgal, and Supantha Pandit
11:20 - 11:40 Approximability of Covering Cells with Line Segments
Paz Carmi, Anil Maheshwari, Saeed Mehrabi, and Luís Fernando Schultz Xavier da Silveira
11:40 - 12:00 Heuristics for the Score-Constrained Strip-Packing Problem
Asyl L. Hawa, Rhyd Lewis, and Jonathan M. Thompson
Lunch 12:00 - 13:30
-
Session 5
Graph Theory
(Session Chair: Manuel Lafond)
13:30 - 13:50 Directed Path-Width of Sequence Digraphs
Frank Gurski, Carolin Rehs, and Jochen Rethmann
13:50 - 14:10 New results about the linearization of scaffolds sharing repeated contigs
Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, and Rodolphe Giroudeau
14:10 - 14:30 Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem
Cristina Bazgan, Paul Beaujean, and Éric Gourdin
14:30 - 14:50 Bipartite Communities via Spectral Partitioning
Kelly B. Yancey and Matthew P. Yancey
14:50 - 15:10 Generating Algebraic Expressions for Labeled Grid Graphs
Mark Korenblit
Coffee Break 15:10 - 15:40
-
Session 6
Computational Geometry & Combinatorial Optimization
(Session Chair: Feodor F. Dragan)
15:40 - 16:00 An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(log(n)) Query Time
Hengzhao Ma and Jianzhong Li
16:00 - 16:20 Exact and Approximate Map-Reduce Algorithms for Convex Hull
Anirban Ghosh and Samuel Schwartz
16:20 - 16:40 Transmitting Particles in a Polygonal Domain by Repulsion
Amirhossein Mozafari and Thomas C. Shermer
16:40 - 17:00 Does a robot path have clearance c?
Ovidiu Daescu and Hemant Malik
17:00 - 17:20 Star Routing: Between Vehicle Routing and Vertex Cover
Diego Delle Donne and Guido Tagliavini

December 17, 2018

Session Time Titles of Talks / Speakers and Authors
Registration
08:00 – 15:10
-
Session 7
Graph Theory
(Session Chair: Asyl Hawa)
08:30 - 08:50 Editing graphs to satisfy diversity requirements
Huda Chuangpishit, Manuel Lafond, and Lata Narayanan
08:50 - 09:10 Computing a rectilinear shortest path amid splinegons in plane
T. Choudhury and R. Inkulu
09:10 - 09:30 Graph problems with obligations
Alexis Cornet and Christian Laforest
09:30 - 09:50 Bipartizing with a matching
Carlos V.G.C. Lima, Dieter Rautenbach, Uéverton S. Souza, and Jayme L. Szwarcfiter
Coffee Break 09:50 - 10:20
-
Session 8 Combinatorial Optimization & Data Structure
(Session Chair: Daphne Skipper)
10:20 - 10:40 Effect of Crowd Composition on the Wisdom of Artificial Crowds Metaheuristic
Christopher J. Lowrance, Dominic M. Larkin, and Sang M. Yim
10:40 - 11:00 Analysis of Consensus Sorting via the Cycle Metric
Ivan Avramovic and Dana S. Richards
11:00 - 11:20 On the competitiveness of memoryless strategies for the $k$-Canadian Traveller Problem
Pierre Bergé, Julien Hemery, Arpad Rimmel and Joanna Tomasik
11:20 - 11:40 Rent Division Among Groups
Mohammad Ghodsi, Mohamad Latifian, Arman Mohammadi, Sadra Moradian, and Masoud Seddighin
11:40 - 12:00 Sequence Sentential Decision Diagrams
Shuhei Denzumi
Lunch 12:00 - 13:30
-
Session 9
Clustering
(Session Chair: Apurva Mudgal)
13:30 - 13:50 Online Unit Covering in Euclidean Space
Adrian Dumitrescu, Anirban Ghosh, and Csaba D. Tóth
13:50 - 14:10 Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem
Mark Velednitsky and Dorit Hochbaum
14:10 - 14:30 Characterizing Cycle-Complete Dissimilarities in Terms of Associated Indexed 2-Hierarchies
Kazutoshi Ando and Kazuya Shoji
14:30 - 14:50 Making Multiple RNA Interaction Practical
Syed Ali Ahmed, Saman Farhat, and Saad Mneimneh
14:50 - 15:10 Max-Min Dispersion on a Line
Tetsuya Araki and Shin-ichi Nakano
Coffee Break 15:10 - 15:30
-
Session 10
Miscellaneous
(Session Chair: Meng Han)
15:30 - 15:50 Integer-Programming Bounds on Pebbling Numbers of Cartesian-Product Graphs
Franklin Kenter & Daphne Skipper
15:50 - 16:10 On the Complexity of Resilience for Aggregation Queries
Dongjing Miao and Zhipeng Cai
16:10 - 16:30 Inefficiency of Equilibria in Doodle Polls
Barbara M. Anthony and Christine Chung
16:30 - 16:50 Network Cost-Sharing Games: Equilibrium Computation and Applications to Election Modeling
Rahul Swamy, Timothy Murray, and Jugal Garg
16:50 - 17:10 Weak-Barrier Coverage with Adaptive Sensor Rotation
Catalina Aranzazu-Suescun and Mihaela Cardei