Остановите войну!
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 49 matches
- 2015
- Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
List Coloring in the Absence of a Linear Forest. Algorithmica 71(1): 21-35 (2015) - A. Karim Abu-Affash:
The Euclidean Bottleneck Full Steiner Tree Problem. Algorithmica 71(1): 139-151 (2015) - Noga Alon, Amit Weinstein:
Local Correction with Constant Error Rate. Algorithmica 71(2): 496-516 (2015) - Patrizio Angelini, Walter Didimo, Stephen G. Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen K. Wismath:
Monotone Drawings of Graphs with Fixed Embedding. Algorithmica 71(2): 233-257 (2015) - Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Algorithmica 71(1): 120-138 (2015) - Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos:
On Subexponential and FPT-Time Inapproximability. Algorithmica 71(3): 541-565 (2015) - Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. Algorithmica 71(3): 566-580 (2015) - Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas:
Generalised k-Steiner Tree Problems in Normed Planes. Algorithmica 71(1): 66-86 (2015) - Robert Bredereck, Thomas Köhler, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
Using Patterns to Form Homogeneous Teams. Algorithmica 71(2): 517-538 (2015) - Leizhen Cai, Yufei Cai:
Incompressibility of H-Free Edge Modification Problems. Algorithmica 71(3): 731-757 (2015) - Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Klau, Julián Mestre:
On Tree-Constrained Matchings and Generalizations. Algorithmica 71(1): 98-119 (2015) - T.-H. Hubert Chan, Mingfei Li, Li Ning:
Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree. Algorithmica 71(1): 53-65 (2015) - Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu:
Linear-Time Algorithms for Tree Root Problems. Algorithmica 71(2): 471-495 (2015) - Bernard Chazelle, Wolfgang Mulzer:
Data Structures on Event Graphs. Algorithmica 71(4): 1007-1020 (2015) - Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter:
Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching. Algorithmica 71(2): 258-278 (2015) - Ashish Chiplunkar, Sundar Vishwanathan:
Metrical Service Systems with Multiple Servers. Algorithmica 71(1): 219-231 (2015) - Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff:
Approximating Minimum Manhattan Networks in Higher Dimensions. Algorithmica 71(1): 36-52 (2015) - Son Hoang Dau, Yeow Meng Chee:
Polynomial Time Algorithm for Min-Ranks of Graphs with Simple Tree Structures. Algorithmica 71(1): 152-180 (2015) - Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz:
Parameterized Analysis of Paging and List Update Algorithms. Algorithmica 71(2): 330-353 (2015) - Michael Elberfeld, Christoph Stockhusen, Till Tantau:
On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness. Algorithmica 71(3): 661-701 (2015) - Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György:
Online File Caching with Rejection Penalties. Algorithmica 71(2): 279-306 (2015) - Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof:
Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. Algorithmica 71(3): 636-660 (2015) - Uriel Feige, Shlomo Jozeph:
Oblivious Algorithms for the Maximum Directed Cut Problem. Algorithmica 71(2): 409-428 (2015) - Andreas Emil Feldmann, Luca Foschini:
Balanced Partitions of Trees and Applications. Algorithmica 71(2): 354-376 (2015) - Andreas Emil Feldmann, Peter Widmayer:
An O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. Algorithmica 71(1): 181-200 (2015) - Fedor V. Fomin, Geevarghese Philip, Yngve Villanger:
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. Algorithmica 71(1): 1-20 (2015) - Mathew C. Francis, Daniel Gonçalves, Pascal Ochem:
The Maximum Clique Problem in Multiple Interval Graphs. Algorithmica 71(4): 812-836 (2015) - Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan:
Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica 71(4): 989-1006 (2015) - Ashwin Guha, Ambedkar Dukkipati:
An Algorithmic Characterization of Polynomial Functions over Zpn. Algorithmica 71(1): 201-218 (2015) - Mangesh Gupte, Darja Krushevskaja, S. Muthukrishnan:
Analyses of Cardinal Auctions. Algorithmica 71(4): 889-903 (2015)
skipping 19 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-04 06:10 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