![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
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 493 matches
- 2024
- Leon Kellerhals:
Multivariate complexity analyses for algorithmic challenges in fairness and sustainability. Technical University of Berlin, Germany, 2024 - Arnab Maiti, Palash Dey
:
On Parameterized Complexity of Binary Networked Public Goods Game. Algorithmica 86(1): 307-333 (2024) - Joanna Raczek
:
Complexity Issues on of Secondary Domination Number. Algorithmica 86(4): 1163-1172 (2024) - Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid
, Ulrich Schmid:
The Time Complexity of Consensus Under Oblivious Message Adversaries. Algorithmica 86(6): 1830-1861 (2024) - Abolfazl Poureidi, Mohammad Farshi
:
On algorithmic complexity of imprecise spanners. Comput. Geom. 117: 102051 (2024) - Dordje Pesic, Milena Vujosevic-Janicic
, Marko Misic
, Jelica Protic:
A novel approach to source code assembling in the field of algorithmic complexity. Comput. Sci. Inf. Syst. 21(3): 781-806 (2024) - Yan Li
, Guanghui Lan, Tuo Zhao:
Homotopic policy mirror descent: policy convergence, algorithmic regularization, and improved sample complexity. Math. Program. 207(1): 457-513 (2024) - Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. ACM Trans. Algorithms 20(2): 15 (2024) - Trisha Chakraborty, Jared Saia, Maxwell Young
:
Defending hash tables from algorithmic complexity attacks with resource burning. Theor. Comput. Sci. 1014: 114762 (2024) - Vladimir Shpilrain:
Complexity of some algorithmic problems in groups: a survey. CoRR abs/2401.09218 (2024) - Boao Kong, Shuchen Zhu, Songtao Lu, Xinmeng Huang, Kun Yuan:
Decentralized Bilevel Optimization over Graphs: Loopless Algorithmic Update and Transient Iteration Complexity. CoRR abs/2402.03167 (2024) - Bostjan Bresar, Babak Samadi:
Edge open packing: complexity, algorithmic aspects, and bounds. CoRR abs/2403.00750 (2024) - Felipe S. Abrahão, Santiago Hernández-Orozco, Narsis A. Kiani, Jesper Tegnér, Hector Zenil:
Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution. CoRR abs/2403.06629 (2024) - Rui Yang, Evgenios M. Kornaropoulos, Yue Cheng
:
Algorithmic Complexity Attacks on Dynamic Learned Indexes. CoRR abs/2403.12433 (2024) - Elias Heftrig, Haya Schulmann, Niklas Vogel, Michael Waidner:
The Harder You Try, The Harder You Fail: The KeyTrap Denial-of-Service Algorithmic Complexity Attacks on DNSSEC. CoRR abs/2406.03133 (2024) - 2023
- Junkang Li:
Games with incomplete information: complexity, algorithmics, reasoning. (Jeux à infοrmatiοn incοmplète: cοmplexité, algοrithmique, raisοnnement). Normandy University, Caen, France, 2023 - Timothée Martinod:
Étude de complexité algorithmique pour des problèmes de domination et de tournées dans les graphes avec obligations. (Algorithmic complexity study for domination and routing problems in graphs with obligations). University of Clermont Auvergne, Clermont-Ferrand, France, 2023 - Soumyajit Paul:
On the algorithmic complexity of two player zero-sum games of finite duration with imperfect information. (Sur la complexité des jeux à somme nulle à deux joueurs de durée finie avec information imparfaite). University of Bordeaux, France, 2023 - Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi:
Parameterized Complexity of Minimum Membership Dominating Set. Algorithmica 85(11): 3430-3452 (2023) - Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, R. Ryan Williams:
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Algorithmica 85(8): 2395-2426 (2023) - Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney
, Richard J. Nowakowski:
The Complexity of Two Colouring Games. Algorithmica 85(4): 1067-1090 (2023) - Júlio Araújo
, Marin Bougeret
, Victor A. Campos
, Ignasi Sau
:
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets. Algorithmica 85(2): 444-491 (2023) - Sumanta Banerjee, Juhi Chaudhary
, Dinabandhu Pradhan:
Unique Response Roman Domination: Complexity and Algorithms. Algorithmica 85(12): 3889-3927 (2023) - Thomas Bellitto, Shaohua Li
, Karolina Okrasa
, Marcin Pilipczuk, Manuel Sorge:
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. Algorithmica 85(5): 1202-1250 (2023) - Matthias Bentert, André Nichterlein:
Parameterized Complexity of Diameter. Algorithmica 85(2): 325-351 (2023) - Gaétan Berthe
, Barnaby Martin
, Daniël Paulusma
, Siani Smith
:
The Complexity of L(p, q)-Edge-Labelling. Algorithmica 85(11): 3406-3429 (2023) - Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo
, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddability of st-Graphs: Complexity and Algorithms. Algorithmica 85(12): 3521-3571 (2023) - Gennaro Cordasco
, Luisa Gargano, Adele A. Rescigno
:
Immunization in the Threshold Model: A Parameterized Complexity Study. Algorithmica 85(11): 3376-3405 (2023) - Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen:
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. Algorithmica 85(7): 1850-1882 (2023) - Massimo Equi, Tuukka Norri
, Jarno Alanko
, Bastien Cazaux, Alexandru I. Tomescu
, Veli Mäkinen
:
Algorithms and Complexity on Indexing Founder Graphs. Algorithmica 85(6): 1586-1623 (2023)
skipping 463 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.org/img/cog.dark.24x24.png)
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-09-01 02:15 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