Остановите войну!
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 51 matches
- 2020
- Julien Clément, Antoine Genitrini:
Binary Decision Diagrams: From Tree Compaction to Sampling. LATIN 2020: 571-583 - Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza:
Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques. LATIN 2020: 587-599 - Bertie Ancona, Ayesha Bajwa, Nancy A. Lynch, Frederik Mallmann-Trenn:
How to Color a French Flag - Biologically Inspired Algorithms for Scale-Invariant Patterning. LATIN 2020: 413-424 - Ny Aina Andriambolamalala, Vlady Ravelomanana:
Transmitting once to Elect a Leader on Wireless Networks. LATIN 2020: 439-450 - Elena Arseneva, Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira:
Flips in Higher Order Delaunay Triangulations. LATIN 2020: 223-234 - Chen Avin, Kaushik Mondal, Stefan Schmid:
Dynamically Optimal Self-adjusting Single-Source Tree Networks. LATIN 2020: 143-154 - Costin Badescu, Ryan O'Donnell:
Lower Bounds for Testing Complete Positivity and Quantum Separability. LATIN 2020: 375-386 - Gill Barequet, Gil Ben-Shachar:
On Minimal-Perimeter Lattice Animals. LATIN 2020: 519-531 - Gill Barequet, Mira Shalah:
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes. LATIN 2020: 532-545 - Frank Bauernöppel, Anil Maheshwari, Jörg-Rüdiger Sack:
An $\varOmega (n3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures. LATIN 2020: 235-246 - Michael A. Bender, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Kostas Tsichlas:
Batched Predecessor and Sorting with Size-Priced Information in External Memory. LATIN 2020: 155-167 - Louisa Seelbach Benkner, Stephan G. Wagner:
On the Collection of Fringe Subtrees in Random Binary Trees. LATIN 2020: 546-558 - Sergey Bereg:
Computing Balanced Convex Partitions of Lines. LATIN 2020: 247-257 - Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov:
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. LATIN 2020: 600-612 - Ivan Bliznets, Danil Sagunov:
Maximizing Happiness in Graphs of Bounded Clique-Width. LATIN 2020: 91-103 - Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner Trees for Hereditary Graph Classes. LATIN 2020: 613-624 - Miklós Bóna:
A Method to Prove the Nonrationality of Some Combinatorial Generating Functions. LATIN 2020: 559-570 - Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat:
Probabilistically Faulty Searching on a Half-Line - (Extended Abstract). LATIN 2020: 168-180 - Kevin Buchin, D. Kosolobov, Willem Sonke, Bettina Speckmann, Kevin Verbeek:
Ordered Strip Packing. LATIN 2020: 258-270 - Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal:
PTAS for Steiner Tree on Map Graphs. LATIN 2020: 3-14 - Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut via Semidefinite Programming. LATIN 2020: 479-490 - Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman:
Monotone Circuit Lower Bounds from Robust Sunflowers. LATIN 2020: 311-322 - Steven Chaplick, Magnús M. Halldórsson, Murilo Santos de Lima, Tigran Tonoyan:
Query Minimization Under Stochastic Uncertainty. LATIN 2020: 181-193 - Siddhesh Chaubal, Anna Gál:
Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions. LATIN 2020: 323-335 - Rami Daknama, Konstantinos Panagiotou, Simon Reisser:
Asymptotics for Push on the Complete Graph. LATIN 2020: 451-463 - Stefan S. Dantchev, Abdul Ghani, Barnaby Martin:
Sherali-Adams and the Binary Encoding of Combinatorial Principles. LATIN 2020: 336-347 - Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl:
On Some Subclasses of Split B1-EPG Graphs. LATIN 2020: 625-636 - Ran Duan, Haoqing He, Tianyi Zhang:
Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees. LATIN 2020: 15-26 - Khaled M. Elbassioni:
Approximation Algorithms for Cost-Robust Discrete Minimization Problems Based on Their LP-Relaxations. LATIN 2020: 27-37 - Vincent Fagnon, Imed Kacem, Giorgio Lucarelli, Bertrand Simon:
Scheduling on Hybrid Platforms: Improved Approximability Window. LATIN 2020: 38-49
skipping 21 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-05-09 22:05 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