Остановите войну!
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 721 matches
- 2024
- Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. SWAT 2024: 1:1-1:19 - Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. SWAT 2024: 29:1-29:17 - Stav Ashur, Sariel Har-Peled:
Local Spanners Revisited. SWAT 2024: 2:1-2:15 - Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Inne Singgih, Grace Stadnyk, Alexander Wiedemann:
Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model. SWAT 2024: 3:1-3:16 - Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. SWAT 2024: 4:1-4:16 - Robert D. Barish, Tetsuo Shibuya:
Recognition and Proper Coloring of Unit Segment Intersection Graphs. SWAT 2024: 5:1-5:19 - Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez:
Destroying Densest Subgraphs Is Hard. SWAT 2024: 6:1-6:17 - Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler:
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. SWAT 2024: 7:1-7:20 - Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan:
Correlation Clustering with Vertex Splitting. SWAT 2024: 8:1-8:17 - Ioana O. Bercea, Jakob Bæk Tejs Houen, Rasmus Pagh:
Daisy Bloom Filters. SWAT 2024: 9:1-9:19 - Magnus Berg, Shahin Kamali:
Online Bin Covering with Frequency Predictions. SWAT 2024: 10:1-10:17 - Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond:
Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius. SWAT 2024: 11:1-11:18 - Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Arboricity-Dependent Algorithms for Edge Coloring. SWAT 2024: 12:1-12:15 - Therese Biedl, Prosenjit Bose, Babak Miraftab:
On the Independence Number of 1-Planar Graphs. SWAT 2024: 13:1-13:13 - Philip Bille, Yakov Nekrich, Solon P. Pissis:
Size-Constrained Weighted Ancestors with Applications. SWAT 2024: 14:1-14:12 - Lotte Blank, Anne Driemel:
Range Reporting for Time Series via Rectangle Stabbing. SWAT 2024: 15:1-15:15 - Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov:
On the Online Weighted Non-Crossing Matching Problem. SWAT 2024: 16:1-16:19 - Gerth Stølting Brodal, Sebastian Wild:
Deterministic Cache-Oblivious Funnelselect. SWAT 2024: 17:1-17:12 - Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Lukas Plätz, Lea Thiel, Sampson Wong:
Dynamic L-Budget Clustering of Curves. SWAT 2024: 18:1-18:17 - Benjamin Merlin Bumpus, Bart M. P. Jansen, Jaime Venne:
Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond. SWAT 2024: 19:1-19:16 - Aleksander B. G. Christiansen, Eva Rotenberg, Juliette Vlieghe:
Sparsity-Parameterised Dynamic Edge Colouring. SWAT 2024: 20:1-20:18 - Seyed Parsa Darbouy, Zachary Friggstad:
Approximating Minimum Sum Coloring with Bundles. SWAT 2024: 21:1-21:14 - Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh:
Stability in Graphs with Matroid Constraints. SWAT 2024: 22:1-22:16 - Zachary Friggstad, Hao Sun:
A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree. SWAT 2024: 23:1-23:15 - Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, Milos Stojakovic:
Optimizing Symbol Visibility Through Displacement. SWAT 2024: 24:1-24:16 - Auguste H. Gezalyan, Soo Kim, Carlos Lopez, Daniel Skora, Zofia Stefankovic, David M. Mount:
Delaunay Triangulations in the Hilbert Metric. SWAT 2024: 25:1-25:17 - Sariel Har-Peled, Eliot Wong Robson:
No-Dimensional Tverberg Partitions Revisited. SWAT 2024: 26:1-26:14 - Kien C. Huynh, Joseph S. B. Mitchell, Linh Nguyen, Valentin Polishchuk:
Optimizing Visibility-Based Search in Polygonal Domains. SWAT 2024: 27:1-27:16 - Bart M. P. Jansen, Ruben F. A. Verhaegh:
Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion. SWAT 2024: 28:1-28:17 - Naonori Kakimura, Ildikó Schlotter:
Parameterized Complexity of Submodular Minimization Under Uncertainty. SWAT 2024: 30:1-30:17
skipping 691 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 05: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