default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSEA² 2019: Kalamata, Greece
- Ilias S. Kotsireas, Panos M. Pardalos, Konstantinos E. Parsopoulos, Dimitris Souravlias, Arsenis Tsokas:
Analysis of Experimental Algorithms - Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers. Lecture Notes in Computer Science 11544, Springer 2019, ISBN 978-3-030-34028-5 - Ioannis Z. Emiris
, Christina Katsamaki:
Voronoi Diagram of Orthogonal Polyhedra in Two and Three Dimensions. 1-20 - Tínaz Ekim, Mordechai Shalom, Oylum Seker:
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation. 21-34 - Neeraj Kumar:
Computing a Minimum Color Path in Edge-Colored Graphs. 35-50 - Akshay Utture, Vedant Somani, Prem Krishnaa, Meghana Nasre:
Student Course Allocation with Constraints. 51-68 - Noé Godinho, Luís Paquete:
A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem. 69-81 - Jun Liu, Yicheng Pan, Qifu Hu, Angsheng Li:
Navigating a Shortest Path with High Probability in Massive Complex Networks. 82-97 - Glencora Borradaile, Hung Le, Baigong Zheng:
Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs. 98-113 - Koba Gelashvili, Nikoloz Grdzelidze, Mikheil Tutberidze:
On New Rebalancing Algorithm. 114-124 - Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka:
Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs. 125-141 - Anirban Ghosh, Brian Hicks, Ronald Shevchenko:
Unit Disk Cover for Massive Point Sets. 142-157 - Stefan Funke, Thomas Mendel:
Improved Contraction Hierarchy Queries via Perfect Stalling. 158-166 - Édouard Bonnet, Diana-Elena Falamas, Rémi Watrigant:
Constraint Generation Algorithm for the Minimum Connectivity Inference Problem. 167-183 - Sirani M. Perera, Daniel Silverio, Austin Ogle:
Efficient Split-Radix and Radix-4 DCT Algorithms and Applications. 184-201 - João Pedro Schmitt, Rafael S. Parpinelli, Fabiano Baldo:
Analysis of Max-Min Ant System with Local Search Applied to the Asymmetric and Dynamic Travelling Salesman Problem with Moving Vehicle. 202-218 - Hisao Tamaki:
Computing Treewidth via Exact and Heuristic Lists of Minimal Separators. 219-236 - Duc-Minh Phan, Laurent Viennot:
Fast Public Transit Routing with Unrestricted Walking Through Hub Labeling. 237-247 - Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, Bora Uçar:
Effective Heuristics for Matchings in Hypergraphs. 248-264 - Kotaro Matsuda, Shuhei Denzumi, Kengo Nakamura, Masaaki Nishino, Norihito Yasuda:
Approximated ZDD Construction Considering Inclusion Relations of Models. 265-282 - Josef Malík, Ondrej Suchý, Tomás Valla:
Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem. 283-299 - Michael Wagner, Ludwig Kampel, Dimitris E. Simos:
Quantum-Inspired Evolutionary Algorithms for Covering Arrays of Arbitrary Strength. 300-316 - Jonas Cleve, Wolfgang Mulzer:
An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model. 317-331 - Çagdas Çalik, Morris Dworkin, Nathan Dykas, René Peralta:
Searching for Best Karatsuba Recurrences. 332-342 - Konstantinos Ameranis, Nikolaos Vathis, Dimitris Fotakis:
Minimum and Maximum Category Constraints in the Orienteering Problem with Time Windows. 343-358 - Hanna Geppert, Martin Wilhelm:
Internal Versus External Balancing in the Evaluation of Graph-Based Number Types. 359-375 - Jyrki Katajainen:
Hacker's Multiple-Precision Integer-Division Program in Close Scrutiny. 376-391 - Alessio Greco, Salvatore Danilo Riccio, Jon Timmis, Giuseppe Nicosia:
Assessing Algorithm Parameter Importance Using Global Sensitivity Analysis. 392-407 - Umutcan Önal, Zafeirakis Zafeirakopoulos:
A Machine Learning Framework for Volume Prediction. 408-423 - Blair D. Sullivan, Andrew van der Poel, Trey Woodlief:
Faster Biclique Mining in Near-Bipartite Graphs. 424-453 - Ovidiu Daescu, Hemant Malik:
k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler. 454-472 - Ask Neve Gamby, Jyrki Katajainen:
A Faster Convex-Hull Algorithm via Bucketing. 473-489 - Raka Jovanovic, Stefan Voß:
Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem. 490-504 - Alessio Petrozziello, Ivan Jordanov:
Automated Deep Learning for Threat Detection in Luggage from X-Ray Images. 505-512 - Marcel Fernandez, John Livieratos:
Algorithmic Aspects on the Construction of Separating Codes. 513-526 - Hanyu Gu, Yefei Zhang, Yakov Zinder:
Lagrangian Relaxation in Iterated Local Search for the Workforce Scheduling and Routing Problem. 527-540 - Abu Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Faryad Darabi Sahneh, Richard Spence:
Approximation Algorithms and an Integer Program for Multi-level Graph Spanners. 541-562
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-26 23:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
