![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/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 699 matches
- 2024
- Sunny Atalig, Marek Chrobak:
A Tight Threshold Bound for Search Trees with 2-Way Comparisons. TAMC 2024: 99-110 - Eleni Bakali, Aggeliki Chalki
, Sotiris Kanellopoulos, Aris Pagourtzis
, Stathis Zachos:
On the Power of Counting the Total Number of Computation Paths of NPTMs. TAMC 2024: 209-220 - Robert D. Barish
, Tetsuo Shibuya
:
Counting on Rainbow k-Connections. TAMC 2024: 272-283 - Nikolay Bazhenov
, Manat Mustafa
:
On Learning Families of Ideals in Lattices and Boolean Algebras. TAMC 2024: 1-13 - C. S. Bhargav
, Prateek Dwivedi
, Nitin Saxena
:
Lower Bounds for the Sum of Small-Size Algebraic Branching Programs. TAMC 2024: 355-366 - Ivan Bliznets
, Markus Hecher
:
Tight Double Exponential Lower Bounds. TAMC 2024: 124-136 - Gaojie Chi, Longkun Guo:
A Local Search Algorithm for Radius-Constrained k-Median. TAMC 2024: 173-184 - Mike Cruchten
:
Kleene Theorems for Lasso Languages and ømega-Languages. TAMC 2024: 111-123 - Jiazhu Fang
, Qizhi Fang, Wenjing Liu
, Qingqin Nong
:
Mechanism Design with Predictions for Facility Location Games with Candidate Locations. TAMC 2024: 38-49 - Simone Faro
, Arianna Pavone
, Caterina Viola
:
Quantum Path Parallelism: A Circuit-Based Approach to Text Searching. TAMC 2024: 247-259 - Zhidan Feng
, Henning Fernau
, Kevin Mann
, Xingqin Qi
:
Offensive Alliances in Signed Graphs. TAMC 2024: 234-246 - Pierre Fraigniaud, Hovhannes A. Harutyunyan:
Source-Oblivious Broadcast. TAMC 2024: 137-148 - Frank Kammer
, Andrej Sajenko
:
Space-Efficient Graph Kernelizations. TAMC 2024: 260-271 - Kamil Khadiev, Maxim Yagafarov:
Time Efficient Implementation for Online K-Server Problem on Trees. TAMC 2024: 296-308 - Ting Liang, Qilong Feng, Xiaoliang Wu, Jinhui Xu, Jianxin Wang:
Improved Approximation Algorithm for the Distributed Lower-Bounded k-Center Problem. TAMC 2024: 309-319 - Yuxi Liu, Mingyu Xiao
:
An Improved Kernel and Parameterized Algorithm for Almost Induced Matching. TAMC 2024: 86-98 - Yuchao Ma, Weian Li, Wanzhi Zhang, Yahui Lei, Zhicheng Zhang, Qi Qi, Qiang Liu, Xingxing Wang:
Joint Bidding in Ad Auctions. TAMC 2024: 344-354 - Debajyoti Mondal
, Md. Saidur Rahman
:
On the 3-Tree Core of Plane Graphs. TAMC 2024: 149-160 - Shin-Ichi Nakano
:
A Gray Code of Ordered Trees. TAMC 2024: 26-37 - Zining Qin, Hau Chan, Chenhao Wang, Ying Zhang:
Mechanism Design for Building Optimal Bridges Between Regions. TAMC 2024: 332-343 - Zeyu Ren
, Yan Liu
:
Endogenous Threshold Selection with Two-Interval Restricted Tests. TAMC 2024: 75-85 - Jayalal Sarma, Kei Uchizawa:
Energy and Output Patterns in Boolean Circuits. TAMC 2024: 185-196 - Simon Schierreich
, José Gaspar Smutný
:
The Parameterized Complexity of Maximum Betweenness Centrality. TAMC 2024: 221-233 - Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Parameterized Complexity of Weighted Target Set Selection. TAMC 2024: 320-331 - Xuehou Tan:
An Optimal and Practical Algorithm for the Planar 2-Center Problem. TAMC 2024: 63-74 - Zhongzheng Tang, Yaxuan Li, Zhuo Diao:
Some Combinatorial Algorithms on the Edge Cover Number of k-Regular Connected Hypergraphs. TAMC 2024: 284-295 - Wenxuan Tao, Gang Chen:
A Coq-Based Infrastructure for Quantum Programming, Verification and Simulation. TAMC 2024: 161-172 - Chenchen Wu, Rolf H. Möhring, Yishui Wang, Dachuan Xu, Dongmei Zhang:
Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques. TAMC 2024: 197-208 - Tomoyuki Yamakami:
Unambiguous and Co-nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters. TAMC 2024: 14-25 - Jingyang Zhao
, Mingyu Xiao
:
An Improved Approximation Algorithm for Metric Triangle Packing. TAMC 2024: 50-62
skipping 669 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/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-08-31 06:32 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