Остановите войну!
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 661 matches
- 2023
- Meng He, Zhen Liu:
Exact and Approximate Range Mode Query Data Structures in Practice. SEA 2023: 19:1-19:22 - Kengo Nakamura, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato:
CompDP: A Framework for Simultaneous Subgraph Counting Under Connectivity Constraints. SEA 2023: 11:1-11:20 - Ramtin Afshar, Michael B. Dillencourt, Michael T. Goodrich, Evrim Ozel:
Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors. SEA 2023: 8:1-8:18 - Jarno N. Alanko, Elena Biagi, Simon J. Puglisi, Jaakko Vuohtoniemi:
Subset Wavelet Trees. SEA 2023: 4:1-4:14 - Markus Anders, Pascal Schweitzer, Julian Stieß:
Engineering a Preprocessor for Symmetry Detection. SEA 2023: 1:1-1:21 - Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, Leo Wendt:
Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover. SEA 2023: 10:1-10:14 - Ruben Becker, Pierluigi Crescenzi, Antonio Cruciani, Bojana Kodric:
Proxying Betweenness Centrality Rankings in Temporal Networks. SEA 2023: 6:1-6:22 - Alexander Bille, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
A Graph-Theoretic Formulation of Exploratory Blockmodeling. SEA 2023: 14:1-14:20 - Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon R. Tarnow:
Hierarchical Relative Lempel-Ziv Compression. SEA 2023: 18:1-18:16 - Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm:
Partitioning the Bags of a Tree Decomposition into Cliques. SEA 2023: 3:1-3:19 - Diego Díaz-Domínguez, Saska Dönges, Simon J. Puglisi, Leena Salmela:
Simple Runs-Bounded FM-Index Designs Are Fast. SEA 2023: 7:1-7:16 - Kamal Eyubov, Marcelo Fonseca Faraj, Christian Schulz:
FREIGHT: Fast Streaming Hypergraph Partitioning. SEA 2023: 15:1-15:16 - Miriam Fischer, Akshay Gupte:
Multilinear Formulations for Computing a Nash Equilibrium of Multi-Player Games. SEA 2023: 12:1-12:14 - Daniel Funke, Peter Sanders:
Efficient Yao Graph Construction. SEA 2023: 20:1-20:20 - Ernestine Großmann, Jonas Sauer, Christian Schulz, Patrick Steil:
Arc-Flags Meet Trip-Based Public Transit Routing. SEA 2023: 16:1-16:18 - Stephen Jaud, Anthony Wirth, Farhana Murtaza Choudhury:
Maximum Coverage in Sublinear Space, Faster. SEA 2023: 21:1-21:20 - Giorgos Kritikakis, Ioannis G. Tollis:
Fast Reachability Using DAG Decomposition. SEA 2023: 2:1-2:17 - Ömer Burak Onar, Tínaz Ekim, Z. Caner Taskin:
Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem. SEA 2023: 13:1-13:18 - Manuel Penschuck:
Engineering Shared-Memory Parallel Shuffling to Generate Random Permutations In-Place. SEA 2023: 5:1-5:20 - Satya Tamby, Daniel Vanderpooten:
Optimizing over the Efficient Set of a Multi-Objective Discrete Optimization Problem. SEA 2023: 9:1-9:13 - Noah Wahl, Lars Gottesbüren:
Greedy Heuristics for Judicious Hypergraph Partitioning. SEA 2023: 17:1-17:16 - Front Matter, Table of Contents, Preface, Conference Organization. SEA 2023: 0:1-0:12
- Loukas Georgiadis:
21st International Symposium on Experimental Algorithms, SEA 2023, July 24-26, 2023, Barcelona, Spain. LIPIcs 265, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-279-2 [contents] - 2022
- Ramtin Afshar, Michael T. Goodrich, Evrim Ozel:
Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees. SEA 2022: 9:1-9:18 - Vasily Alferov, Mateus de Oliveira Oliveira:
On the Satisfiability of Smooth Grid CSPs. SEA 2022: 18:1-18:14 - Nico Bertram, Jonas Ellert, Johannes Fischer:
A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs. SEA 2022: 10:1-10:15 - Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
A Branch-And-Bound Algorithm for Cluster Editing. SEA 2022: 13:1-13:19 - Maria J. Blesa, Mihail Eduard Popa, Maria J. Serna:
Relating Real and Synthetic Social Networks Through Centrality Measures. SEA 2022: 7:1-7:21 - Nathaniel K. Brown, Travis Gagie, Massimiliano Rossi:
RLBWT Tricks. SEA 2022: 16:1-16:16 - Dorota Celinska-Kopczynska, Eryk Kopczynski:
Discrete Hyperbolic Random Graph Model. SEA 2022: 1:1-1:19
skipping 631 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-07-03 19:34 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