Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 691 matches
- 2024
- Nico Bertram, Johannes Fischer, Lukas Nalbach:
Move-r: Optimizing the r-index. SEA 2024: 1:1-1:19 - Paolo Boldi, Stefano Marchini, Sebastiano Vigna:
Engineering Zuffix Arrays. SEA 2024: 2:1-2:18 - Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu:
Practical Minimum Path Cover. SEA 2024: 3:1-3:19 - Jonas Charfreitag, Christine Dahn, Michael Kaibel, Philip Mayer, Petra Mutzel, Lukas Schürmann:
Separator Based Data Reduction for the Maximum Cut Problem. SEA 2024: 4:1-4:21 - Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz, Daniel Seemaier:
Buffered Streaming Edge Partitioning. SEA 2024: 5:1-5:21 - Giovanna Kobus Conrado, Amir Kafshdar Goharshady, Pavel Hudec, Pingjiang Li, Harshit J. Motwani:
Faster Treewidth-Based Approximations for Wiener Index. SEA 2024: 6:1-6:19 - Theo Conrads, Lukas Drexler, Joshua Könen, Daniel R. Schmidt, Melanie Schmidt:
Local Search k-means++ with Foresight. SEA 2024: 7:1-7:20 - David Coudert, Mónika Csikós, Guillaume Ducoffe, Laurent Viennot:
Practical Computation of Graph VC-Dimension. SEA 2024: 8:1-8:20 - Patrick Dinklage, Johannes Fischer, Nicola Prezza:
Top- k Frequent Patterns in Streams and Parameterized-Space LZ Compression. SEA 2024: 9:1-9:20 - Dominika Draesslerová, Omar Ahmed, Travis Gagie, Jan Holub, Ben Langmead, Giovanni Manzini, Gonzalo Navarro:
Taxonomic Classification with Maximal Exact Matches in KATKA Kernels and Minimizer Digests. SEA 2024: 10:1-10:13 - Marcelo Fonseca Faraj, Ernestine Großmann, Felix Joos, Thomas Möller, Christian Schulz:
Engineering Weighted Connectivity Augmentation Algorithms. SEA 2024: 11:1-11:22 - S. M. Ferdous, Alex Pothen, Mahantesh Halappanavar:
Streaming Matching and Edge Cover in Practice. SEA 2024: 12:1-12:22 - Sebastian Bernhard Germann, Klaus Jansen, Felix Ohnesorge, Malte Tutas:
3/2-Dual Approximation for CPU/GPU Scheduling. SEA 2024: 13:1-13:18 - Andreas Grigorjew, Fernando H. C. Dias, Andrea Cracco, Romeo Rizzi, Alexandru I. Tomescu:
Accelerating ILP Solvers for Minimum Flow Decompositions Through Search Space and Dimensionality Reductions. SEA 2024: 14:1-14:19 - Daniel Hambly, Rhyd Lewis, Padraig Corcoran:
Determining Fixed-Length Paths in Directed and Undirected Edge-Weighted Graphs. SEA 2024: 15:1-15:11 - Deborah Hendrych, Mathieu Besançon, Sebastian Pokutta:
Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods. SEA 2024: 16:1-16:22 - Frederik L. Jatzkowski, Antonia Schmidt, Robert Mank, Steffen Schüler, Matthias Müller-Hannemann:
Barcode Selection and Layout Optimization in Spatial Transcriptomics. SEA 2024: 17:1-17:19 - Jakub Komárek, Martin Koutecký:
Experimental Analysis of LP Scaling Methods Based on Circuit Imbalance Minimization. SEA 2024: 18:1-18:21 - Nick Krumbholz, Stefan Funke, Peter Schäfer, Sabine Storandt:
Algorithms for Gradual Polyline Simplification. SEA 2024: 19:1-19:18 - Kenneth Langedal, Demian Hespe, Peter Sanders:
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks. SEA 2024: 20:1-20:21 - Matthew D. Laws, Jocelyn Bliven, Kit Conklin, Elyes Laalai, Samuel McCauley, Zach S. Sturdevant:
SPIDER: Improved Succinct Rank and Select Performance. SEA 2024: 21:1-21:18 - Vadim Lebovici, Steve Oudot, Hugo Passe:
Efficient Computation of Topological Integral Transforms. SEA 2024: 22:1-22:19 - Philip Mayer, Petra Mutzel:
Engineering A* Search for the Flip Distance of Plane Triangulations. SEA 2024: 23:1-23:20 - Matthew N. Palmer, Simone Faro, Stefano Scafiti:
Efficient Exact Online String Matching Through Linked Weak Factors. SEA 2024: 24:1-24:14 - Gabriel Ponte, Marcia Fampa, Jon Lee:
Convex Relaxation for the Generalized Maximum-Entropy Sampling Problem. SEA 2024: 25:1-25:14 - Takehide Soh, Takumu Watanabe, Jun Kawahara, Akira Suzuki, Takehiro Ito:
Scalable Hard Instances for Independent Set Reconfiguration. SEA 2024: 26:1-26:15 - Christoph Staudt, Mark Blacher, Julien Klaus, Farin Lippmann, Joachim Giesen:
Improved Cut Strategy for Tensor Network Contraction Orders. SEA 2024: 27:1-27:19 - Sebastián Urrutia, Vinícius Fernandes dos Santos:
Finding the Minimum Cost Acceptable Element in a Sorted Matrix. SEA 2024: 28:1-28:14 - Front Matter, Table of Contents, Preface, Conference Organization. SEA 2024: 0:i-0:xviii
- Leo Liberti:
22nd International Symposium on Experimental Algorithms, SEA 2024, July 23-26, 2024, Vienna, Austria. LIPIcs 301, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-325-6 [contents]
skipping 661 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-05 01:59 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint