Остановите войну!
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 135 matches
- 2024
- Tuukka Korhonen, Marek Sokolowski:
Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth. CoRR abs/2402.12364 (2024) - 2023
- Shen Cong:
Almost sure stability criterion for continuous-time linear systems with uniformly distributed uncertainty. Autom. 149: 110848 (2023) - Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. Commun. ACM 66(12): 85-92 (2023) - Chenchen Fan, James Lam, Xiaochen Xie, Panshuo Li:
Stability and Stabilization of Almost Periodic Piecewise Linear Systems With Dwell Time Uncertainty. IEEE Trans. Autom. Control. 68(2): 1130-1137 (2023) - Thatchaphol Saranurak, Wuwei Yuan:
Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k. ESA 2023: 92:1-92:9 - Amir Abboud, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak:
All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. FOCS 2023: 2204-2212 - Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. FOCS 2023: 503-514 - Manuel Cáceres:
Minimum Chain Cover in Almost Linear Time. ICALP 2023: 31:1-31:12 - Rasmus Kyng:
An Almost-Linear Time Algorithm for Maximum Flow and More (Invited Talk). ICALP 2023: 2:1-2:1 - Wanshan Li, Daren Wang, Alessandro Rinaldo:
Divide and Conquer Dynamic Programming: An Almost Linear Time Change Point Detection Methodology in High Dimensions. ICML 2023: 20065-20148 - Xiaoyu He, Ray Li:
Approximating Binary Longest Common Subsequence in Almost-Linear Time. STOC 2023: 1145-1158 - Manuel Cáceres:
Minimum Chain Cover in Almost Linear Time. CoRR abs/2305.02166 (2023) - Takatora Suzuki, Han Guo, Momoko Hayamizu:
Rooted Almost-binary Phylogenetic Networks for which the Maximum Covering Subtree Problem is Solvable in Linear Time. CoRR abs/2305.15132 (2023) - Thatchaphol Saranurak, Wuwei Yuan:
Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k. CoRR abs/2307.00147 (2023) - Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. CoRR abs/2309.16629 (2023) - Matthew Deakin, Davis Montenegro:
Demonstrating Almost Linear Time Complexity of Bus Admittance Matrix-Based Distribution Network Power Flow: An Empirical Approach. CoRR abs/2311.11704 (2023) - Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg:
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. CoRR abs/2311.18295 (2023) - 2022
- Guillaume Ducoffe:
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. Algorithmica 84(11): 3489-3520 (2022) - Guoliang Wang, Yuanyuan Sun:
Almost Sure Stabilization of Continuous-Time Jump Linear Systems via a Stochastic Scheduled Controller. IEEE Trans. Cybern. 52(5): 2712-2724 (2022) - Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. FOCS 2022: 612-623 - Rasmus Kyng, Simon Meierhans, Maximilian Probst:
Derandomizing Directed Random Walks in Almost-Linear Time. FOCS 2022: 407-418 - Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Deterministic Small Vertex Connectivity in Almost Linear Time. FOCS 2022: 789-800 - Lorenzo Orecchia, Konstantinos Ameranis, Charalampos E. Tsourakakis, Kunal Talwar:
Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. ICML 2022: 17071-17093 - Ilias Diakonikolas, Daniel M. Kane, Daniel Kongsgaard, Jerry Li, Kevin Tian:
Clustering mixture models in almost-linear time via list-decodable mean estimation. STOC 2022: 1262-1275 - Vít Kalisz, Pavel Klavík, Peter Zeman:
Circle Graph Isomorphism in Almost Linear Time. TAMC 2022: 176-188 - Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. CoRR abs/2203.00671 (2022) - Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen:
Negative-Weight Single-Source Shortest Paths in Almost-linear Time. CoRR abs/2203.03456 (2022) - Mikhail Cherniavskii, Boris Goldengorin:
An almost linear time complexity algorithm for the Tool Loading Problem. CoRR abs/2207.02004 (2022) - Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
Derandomizing Directed Random Walks in Almost-Linear Time. CoRR abs/2208.10959 (2022) - Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Deterministic Small Vertex Connectivity in Almost Linear Time. CoRR abs/2210.13739 (2022)
skipping 105 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-12 01:38 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