×

zbMATH — the first resource for mathematics

17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. (English) Zbl 1390.68017
LIPIcs – Leibniz International Proceedings in Informatics 103. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-070-5). xi, 30 articles, not consecutively paged, electronic only, open access (2018).

Show indexed articles as search result.

The articles of mathematical interest will be reviewed individually. For the preceding symposium see [Zbl 1372.68011].
Indexed articles:
Heuer, Tobias; Sanders, Peter; Schlag, Sebastian, Network flow-based refinement for multilevel hypergraph partitioning, Article 1, 19 p. [Zbl 07286674]
Shaydulin, Ruslan; Safro, Ilya, Aggregative coarsening for multilevel hypergraph partitioning, Article 2, 15 p. [Zbl 07286675]
Biedermann, Sonja; Henzinger, Monika; Schulz, Christian; Schuster, Bernhard, Memetic graph clustering, Article 3, 15 p. [Zbl 07286676]
Henzinger, Alexandra; Noe, Alexander; Schulz, Christian, ILP-based local search for graph partitioning, Article 4, 15 p. [Zbl 07286677]
Matsumoto, Kosuke; Hatano, Kohei; Takimoto, Eiji, Decision diagrams for solving a job scheduling problem under precedence constraints, Article 5, 12 p. [Zbl 07286678]
Sedaghat, Nafiseh; Stephen, Tamon; Chindelevitch, Leonid, Speeding up dualization in the Fredman-Khachiyan algorithm B, Article 6, 13 p. [Zbl 07286679]
Külekci, M. Oguzhan, An ambiguous coding scheme for selective encryption of high entropy volumes, Article 7, 13 p. [Zbl 07286680]
Cooper, Frances; Manlove, David, A \(\frac{3}{2}\)-approximation algorithm for the student-project allocation problem, Article 8, 13 p. [Zbl 07286681]
Krishnapriya, A. M.; Nasre, Meghana; Nimbhorkar, Prajakta; Rawat, Amit, How good are popular matchings?, Article 9, 14 p. [Zbl 07286682]
Altmanová, Katerina; Knop, Dusan; Koutecký, Martin, Evaluating and tuning \(n\)-fold integer programming, Article 10, 14 p. [Zbl 07286683]
Bastubbe, Michael; Lübbecke, Marco E.; Witt, Jonas T., A computational investigation on the strength of Dantzig-Wolfe reformulations, Article 11, 12 p. [Zbl 07286684]
Kiljan, Krzysztof; Pilipczuk, Marcin, Experimental evaluation of parameterized algorithms for feedback vertex set, Article 12, 12 p. [Zbl 07286685]
Haraguchi, Kazuya, An efficient local search for the minimum independent dominating set problem, Article 13, 13 p. [Zbl 07286686]
Nadara, Wojciech; Pilipczuk, Marcin; Rabinovich, Roman; Reidl, Felix; Siebertz, Sebastian, Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness, Article 14, 16 p. [Zbl 07286687]
Ahmed, Reyan; Angelini, Patrizio; Sahneh, Faryad Darabi; Efrat, Alon; Glickenstein, David; Gronemann, Martin; Heinsohn, Niklas; Kobourov, Stephen G.; Spence, Richard; Watkins, Joseph; Wolff, Alexander, Multi-level Steiner trees, Article 15, 14 p. [Zbl 07286688]
Pissis, Solon P.; Retha, Ahmad, Dictionary matching in elastic-degenerate texts with applications in searching VCF files on-line, Article 16, 14 p. [Zbl 07286689]
Belazzougui, Djamal; Cunial, Fabio; Denas, Olgert, Fast matching statistics in small space, Article 17, 14 p. [Zbl 07286690]
Cazaux, Bastien; Juhel, Samuel; Rivals, Eric, Practical lower and upper bounds for the shortest linear superstring, Article 18, 14 p. [Zbl 07286691]
Baffier, Jean-François; Diez, Yago; Korman, Matias, Experimental study of compressed stack algorithms in limited memory environments, Article 19, 13 p. [Zbl 07286692]
Wilhelm, Martin, Restructuring expression dags for efficient parallelization, Article 20, 13 p. [Zbl 07286693]
Nakahata, Yu; Kawahara, Jun; Kasahara, Shoji, Enumerating graph partitions without too small connected components using zero-suppressed binary and ternary decision diagrams, Article 21, 13 p. [Zbl 07286694]
Chimani, Markus; Hedtke, Ivo; Wiedera, Tilo, Exact algorithms for the maximum planar subgraph problem: new models and experiments, Article 22, 15 p. [Zbl 07286695]
Huang, Shixun; Bao, Zhifeng; Culpepper, J. Shane; Zhang, Ping; Zhang, Bang, A linear-time algorithm for finding induced planar subgraphs, Article 23, 15 p. [Zbl 07286696]
Aleardi, Luca Castelli; Denis, Gaspard; Fusy, Éric, Fast spherical drawing of triangulations: an experimental study of graph drawing tools, Article 24, 14 p. [Zbl 07286697]
Bsaybes, Sahar; Quilliot, Alain; Wagler, Annegret K., Fleet management for autonomous vehicles using multicommodity coupled flows in time-expanded networks, Article 25, 14 p. [Zbl 07286698]
Pereira, Vinicius N. G.; San, Felice Mário César; Hokama, Pedro Henrique D. B.; Xavier, Eduardo C., The Steiner multi cycle problem with applications to a collaborative truckload problem, Article 26, 13 p. [Zbl 07286699]
Buchhold, Valentin; Sanders, Peter; Wagner, Dorothea, Real-time traffic assignment using fast queries in customizable contraction hierarchies, Article 27, 15 p. [Zbl 07286700]
Kaski, Petteri; Lauri, Juho; Thejaswi, Suhas, Engineering motif search for large motifs, Article 28, 19 p. [Zbl 07286701]
Ziobro, Michal; Pilipczuk, Marcin, Finding Hamiltonian cycle in graphs of bounded tree-width: experimental evaluation, Article 29, 14 p. [Zbl 07286702]
Piperno, Adolfo, Isomorphism test for digraphs with weighted edges, Article 30, 13 p. [Zbl 07286703]

MSC:
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Wxx Algorithms in computer science
00B25 Proceedings of conferences of miscellaneous specific interest
PDF BibTeX XML Cite
Full Text: DOI Link