Остановите войну!
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 35 matches
- 2017
- Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri:
Efficient Algorithms for k-Regret Minimizing Sets. SEA 2017: 7:1-7:23 - Andrei Alexandrescu:
Fast Deterministic Selection. SEA 2017: 24:1-24:19 - Daniyah A. Aloqalaa, Jenny A. Hodgson, Prudence W. H. Wong:
The Impact of Landscape Sparsification on Modelling and Analysis of the Invasion Process. SEA 2017: 32:1-32:16 - Radu Baltean-Lugojan, Christodoulos A. Floudas, Ruth Misener, Miten Mistry:
Designing Energy-Efficient Heat Recovery Networks using Mixed-Integer Nonlinear Optimisation. SEA 2017: 1:1-1:1 - Max Bannach, Sebastian Berndt, Thorsten Ehlers:
Jdrasil: A Modular Library for Computing Tree Decompositions. SEA 2017: 28:1-28:21 - Nicola Basilico, Stefano Coniglio, Nicola Gatti, Alberto Marchesi:
Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower Equilibria. SEA 2017: 31:1-31:14 - Moritz Baum, Jonas Sauer, Dorothea Wagner, Tobias Zündorf:
Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications. SEA 2017: 19:1-19:18 - Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit:
Practical Range Minimum Queries Revisited. SEA 2017: 12:1-12:16 - Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit:
The Quantile Index - Succinct Self-Index for Top-k Document Retrieval. SEA 2017: 15:1-15:14 - Amariah Becker, Eli Fox-Epstein, Philip N. Klein, David Meierfrankenfeld:
Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs. SEA 2017: 8:1-8:17 - Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe:
Faster Betweenness Centrality Updates in Evolving Networks. SEA 2017: 23:1-23:16 - Lars Briem, H. Sebastian Buck, Holger Ebhart, Nicolai Mallig, Ben Strasser, Peter Vortisch, Dorothea Wagner, Tobias Zündorf:
Efficient Traffic Assignment for Public Transit Networks. SEA 2017: 20:1-20:14 - Stefano Coniglio, Stefano Gualandi:
On the Separation of Topology-Free Rank Inequalities for the Max Stable Set Problem. SEA 2017: 29:1-29:13 - Graham Cormode:
Engineering Streaming Algorithms. SEA 2017: 3:1-3:1 - Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane:
Compression with the tudocomp Framework. SEA 2017: 13:1-13:22 - Martin Farach-Colton:
Dictionaries Revisited. SEA 2017: 2:1-2:1 - Jacob Focke, Nicole Megow, Julie Meißner:
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. SEA 2017: 22:1-22:14 - Paulo G. S. da Fonseca, Israel B. F. da Silva:
Online Construction of Wavelet Trees. SEA 2017: 16:1-16:14 - Stefan Funke, Sören Laue, Sabine Storandt:
Personal Routes with High-Dimensional Costs and Dynamic Approximation Guarantees. SEA 2017: 18:1-18:13 - Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou:
Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders. SEA 2017: 9:1-9:16 - Loukas Georgiadis, Konstantinos Giannis, Aikaterini Karanasiou, Luigi Laura:
Incremental Low-High Orders of Directed Graphs and Applications. SEA 2017: 27:1-27:21 - Robert Lion Gottwald, Stephen J. Maher, Yuji Shinano:
Distributed Domain Propagation. SEA 2017: 6:1-6:11 - Tobias Heuer, Sebastian Schlag:
Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure. SEA 2017: 21:1-21:19 - Michael Huang, Clifford Stein:
Extending Search Phases in the Micali-Vazirani Algorithm. SEA 2017: 10:1-10:19 - Juha Kärkkäinen, Dominik Kempa:
Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet. SEA 2017: 17:1-17:14 - Harshita Kudaravalli, Miguel A. Mosteiro:
Ad-Hoc Affectance-Selective Families for Layer Dissemination. SEA 2017: 33:1-33:16 - Leo Liberti, Claudia D'Ambrosio:
The Isomap Algorithm in Distance Geometry. SEA 2017: 5:1-5:13 - Jihyuk Lim, Kunsoo Park:
Algorithm Engineering for All-Pairs Suffix-Prefix Matching. SEA 2017: 14:1-14:12 - Antoine Limasset, Guillaume Rizk, Rayan Chikhi, Pierre Peterlongo:
Fast and Scalable Minimal Perfect Hashing for Massive Key Sets. SEA 2017: 25:1-25:16 - Orlando Moreira, Merten Popp, Christian Schulz:
Graph Partitioning with Acyclicity Constraints. SEA 2017: 30:1-30:15
skipping 5 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-06-06 07:31 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