Остановите войну!
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 56 matches
- 2012
- Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. LATIN 2012: 1-12 - Eric Angel, Evripidis Bampis, Vincent Chau:
Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines. LATIN 2012: 13-24 - Esther M. Arkin, José Miguel Díaz-Báñez, Ferran Hurtado, Piyush Kumar, Joseph S. B. Mitchell, Belén Palop, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira:
Bichromatic 2-Center of Pairs of Points. LATIN 2012: 25-36 - Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar:
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs. LATIN 2012: 37-48 - Rafael da Ponte Barbosa, Yoshiko Wakabayashi:
A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem. LATIN 2012: 49-60 - Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith:
On the Advice Complexity of the Knapsack Problem. LATIN 2012: 61-72 - Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. LATIN 2012: 73-84 - Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
On Plane Constrained Bounded-Degree Spanners. LATIN 2012: 85-96 - Joshua Brody, Hongyu Liang, Xiaoming Sun:
Space-Efficient Approximation Scheme for Circular Earth Mover Distance. LATIN 2012: 97-108 - Ana Busic, Nazim Fatès, Jean Mairesse, Irène Marcovici:
Density Classification on Infinite Lattices and Trees. LATIN 2012: 109-120 - Jean Cardinal, Matias Korman:
Coloring Planar Homothets and Three-Dimensional Hypergraphs. LATIN 2012: 121-132 - Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum:
An Equivariance Theorem with Applications to Renaming. LATIN 2012: 133-144 - Armando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal:
Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks. LATIN 2012: 145-156 - Eda Cesaratto, Brigitte Vallée:
Pseudorandomness of a Random Kronecker Sequence. LATIN 2012: 157-171 - Richard Cole, Vijaya Ramachandran:
Revisiting the Cache Miss Analysis of Multithreaded Algorithms. LATIN 2012: 172-183 - Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh:
Parameterized Complexity of MaxSat above Average. LATIN 2012: 184-194 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. LATIN 2012: 195-206 - Daniel Dadush:
A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming. LATIN 2012: 207-218 - Pooya Davoodi, Michiel H. M. Smid, Freek van Walderveen:
Two-Dimensional Range Diameter Queries. LATIN 2012: 219-230 - Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
An Improved Upper Bound on the Density of Universal Random Graphs. LATIN 2012: 231-242 - Volker Diekert, Jonathan Kausch, Markus Lohrey:
Logspace Computations in Graph Groups and Coxeter Groups. LATIN 2012: 243-254 - Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho:
Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points. LATIN 2012: 255-266 - Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman:
On the Radon Number for P 3-Convexity. LATIN 2012: 267-278 - Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister:
Computing Minimum Geodetic Sets of Proper Interval Graphs. LATIN 2012: 279-290 - Zoltán Ésik, Szabolcs Iván:
Hausdorff Rank of Scattered Context-Free Linear Orders. LATIN 2012: 291-302 - Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. LATIN 2012: 303-314 - MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab S. Mirrokni, Sina Sadeghian Sadeghabad:
On the Non-progressive Spread of Influence through Social Networks. LATIN 2012: 315-326 - Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo:
Clique-Colouring and Biclique-Colouring Unichord-Free Graphs. LATIN 2012: 530-541 - Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki:
Forbidden Patterns. LATIN 2012: 327-337 - Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek:
Structural Complexity of Multiobjective NP Search Problems. LATIN 2012: 338-349
skipping 26 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-04-27 11:51 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