[CPM-SPIRE-L] SEA 2020 - Final Call for Participation

Simone Faro faro at dmi.unict.it
Tue Jun 9 06:15:53 PDT 2020


Please, accept our apologies if you receive multiple copies of this  
announcement

-----------------------------------------
18th International Symposium on Experimental Algorithms (SEA 2020)
June 16-18, 2020, (Remotely from) Catania, Italy
http://www.sea2020.dmi.unict.it

------------------------------------------
CALL FOR PARTICIPATION - FREE REGISTRATION
------------------------------------------
SEA (International Symposium on Experimental Algorithms), previously  
known as Workshop on Experimental Algorithms (WEA), is an  
international forum for researchers in the area of the design,  
analysis, and experimental evaluation and engineering of algorithms,  
as well as in various aspects of computational optimization and its  
applications.

Based on the current health situation in Italy and around the world,  
SEA 2020 conference leadership has decided that the most prudent  
measure is to deliver the conference online to all registered  
attendees, rather than by a physical meeting. As a consequence,  
registration fees for attendees will be FREE OF CHARGE.


-----------------------------------------
CONFERENCE PROGRAM
-----------------------------------------

SESSION 1 - June 16, 2020 AM

8:30
	Wellcome
9:00 - 10:00 Invited Talk
	N. Prezza
	Indexing Compressed Text: a Tale of Time and Space
10:00 - 10:15
	VIRTUAL TOUR OF CATANIA : THE BENEDECTINE MONASTRY

-- BREAK

10:30 - 11:00
	M. Fonseca Faraj, A. van der Grinten, H. Meyerhenke, J. Larsson Träff  
and C. Schulz
	High-Quality Hierarchical Process Mapping
11:00 - 11:30
	S. Fekete, A. Hill, D. Krupke, T. Mayer, J. Mitchell, O. Parekh and  
C. Phillips
	Probing a Set of Trajectories to Maximize Captured
11:30 - 12:00
	K. Matsuda, S. Denzumi and K. Sadakane
	Storing Set Families More Compactly with Top ZDDs
12:00 - 12:30
	D. Köppl, S. Puglisi and R. Raman
	Fast and Simple Compact Hashing via Bucketing


SESSION 2 - June 16, 2020 PM

15:00 - 15:30
	D. Berend and Y. Twitto
	Effect of Initial Assignment on Local Search Performance for Max Sat
15:30 - 16:00
	Y. Nakahata, M. Nishino, J. Kawahara and S. Minato
	Enumerating All Subgraphs under Given Constraints Using  
Zero-suppressed Sentential Decision Diagrams
16:00 - 16:30
	L. Gottesbüren, M. Hamann, P. Schoch, B. Strasser, D. Wagner and S. Zühlsdorf
	Engineering Exact Quasi-Threshold Editing
16:30 - 16:45
	VIRTUAL TOUR OF CATANIA : THE HISTORICAL CITY CENTER

-- BREAK

17:00 - 17:30
	L. Gottesbüren, M. Hamann, S. Schlag and D. Wagner
	Advanced Flow-Based Multilevel Hypergraph Partitioning
17:30 - 18:00
	Z. Liptak, S. Puglisi and M. Rossi
	Pattern Discovery in Colored Strings
18:00 - 18:30
	S. Kobayashi, D. Hendrian, R. Yoshinaka and A. Shinohara
	Fast and linear-time string matching algorithms based on the  
distances of q-gram occurrences


SESSION 3 - June 17, 2020 AM

9:00 - 10:00 Invited Talk
	S. Edelkamp
	Algorithm Engineering for Sorting and Searching, and All That
10:00 - 10:15
	VIRTUAL TOUR OF CATANIA : AT THE TOP OF ETNA

-- BREAK

10:30 - 11:00
	K. Hanauer, M. Henzinger and C. Schulz
	Faster Fully Dynamic Transitive Closure in Practice
11:00 - 11:30
	T. Maier, P. Sanders and R. Williger
	Concurrent Expandable AMQs on the Basis of Quotient Filters
11:30 - 12:00
	J. Sauer, D. Wagner and T. Zündorf
	Faster Multi-Modal Route Planning with Bike Sharing Using ULTRA
12:00 - 12:30
	A. Kleff, F. Schulz, J. Wagenblatt and T. Zeitz
	Efficient Route Planning with Temporary Driving Bans, Road Closures,  
and Rated Parking Areas


PAUSE on June 17, 2020 PM


SESSION 4 - June 18, 2020 AM

9:00 - 10:00 Invited Talk
	M. Aumuller
	Algorithm Engineering for High-Dimensional Similarity Search Problems
10:00 - 10:15
	VIRTUAL TOUR OF CATANIA : THE SEA

-- BREAK

10:30 - 11:00
	A. Al Zoobi, D. Coudert and N. Nisse
	Space and time tradeoffs for the k shortest simple paths problem
11:00 - 11:30
	J. Trimble
	An Algorithm for the Exact Treedepth Problem
11:30 - 12:00
	F. Cooper and D. Manlove
	Algorithms for new types of fair stable matchings
12:00 - 12:30
	D. Antypov, A. Deligkas, V. Gusev, M. Rosseinsky, P. Spirakis and M.  
Theofilatos
	Crystal Structure Prediction via Oblivious Local Search


SESSION 5 - June 18, 2020 PM

15:00 - 15:30
	K. Nakamura, S. Denzumi and M. Nishino
	Variable Shift SDD: A More Succinct Sentential Decision Diagram
15:30 - 16:00
	E. Kuthe and S. Rahmann
	Engineering Fused Lasso Solvers on Trees
16:00 - 16:30
	R. Grossi, A. Marino and S. Moghtasedi
	Finding Structurally and Temporally Similar Trajectories in Graphs
16:30 - 16:45
	VIRTUAL TOUR OF CATANIA : TAORMINA AND THE GREEK THEATRE

-- BREAK

17:00 - 17:30
	L. Barth and D. Wagner
	Zipping Segment Trees
17:30 - 18:00
	V. Buchhold, D. Delling, D. Schieferdecker and M. Wegner
	Fast and Stable Repartitioning of Road Networks
18:00 - 18:30
	M. He and S. Kazi
	Path Query Data Structures in Practice
18:30
	CLOSING

-----------------------------------------
FURTHER INFORMATION AND CONTACTS
-----------------------------------------
Web: http://www.sea2020.dmi.unict.it
Email: sea2020 at easychair.org





More information about the CPM-SPIRE-L mailing list