Остановите войну!
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 29 matches
- 2023
- Yaroslav Alekseev, Edward A. Hirsch:
The Power of the Binary Value Principle. CIAC 2023: 21-36 - Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue:
Independent Set Under a Change Constraint from an Initial Solution. CIAC 2023: 37-51 - Hagit Attiya, Noa Schiller:
Asynchronous Fully-Decentralized SGD in the Cluster-Based Model. CIAC 2023: 52-66 - Lorenzo Balzotti, Paolo Giulio Franciosa:
Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time. CIAC 2023: 67-81 - Lorenzo Balzotti, Paolo Giulio Franciosa:
How Vulnerable is an Undirected Planar Graph with Respect to Max Flow. CIAC 2023: 82-96 - Tal Ben-Nun, Lukas Gianinazzi, Torsten Hoefler, Yishai Oltchik:
Maximum Flows in Parametric Graph Templates. CIAC 2023: 97-111 - Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy:
Dynamic Coloring on Restricted Graph Classes. CIAC 2023: 112-126 - Thomas Bläsius, Adrian Feilhauer, Jannik Westenfelder:
Dynamic Flows with Time-Dependent Capacities. CIAC 2023: 142-156 - Ivan Bliznets, Danil Sagunov, Eugene Tagin:
Enumeration of Minimal Tropical Connected Sets. CIAC 2023: 127-141 - Nader H. Bshouty:
On One-Sided Testing Affine Subspaces. CIAC 2023: 157-171 - Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski, Pavan Poudel:
Stable Scheduling in Transactional Memory. CIAC 2023: 172-186 - Jannik Castenow, Jonas Harbig, Friedhelm Meyer auf der Heide:
Unifying Gathering Protocols for Swarms of Mobile Robots. CIAC 2023: 5-16 - Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N:
Parameterizing Path Partitions. CIAC 2023: 187-201 - Simon D. Fink, Ignaz Rutter:
Maintaining Triconnected Components Under Node Expansion. CIAC 2023: 202-216 - Toshihiro Fujito, Kneto Mukae, Junya Tsuzuki:
Approximating Power Node-Deletion Problems. CIAC 2023: 217-231 - Éric Fusy, Gregory Kucherov:
Phase Transition in Count Approximation by Count-Min Sketch with Conservative Updates. CIAC 2023: 232-246 - Kerem Geva, Matthew J. Katz, Joseph S. B. Mitchell, Eli Packer:
Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the Plane. CIAC 2023: 247-262 - Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda:
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CIAC 2023: 263-277 - Hovhannes A. Harutyunyan, Narek A. Hovhannisyan:
Broadcasting in Split Graphs. CIAC 2023: 278-292 - Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma:
Partitioning Subclasses of Chordal Graphs with Few Deletions. CIAC 2023: 293-307 - Pascal Koiran, Subhayan Saha:
Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision. CIAC 2023: 308-322 - Manish Kumar, Anisur Rahaman Molla, Sumathi Sivasubramaniam:
Improved Deterministic Leader Election in Diameter-Two Networks. CIAC 2023: 323-335 - Victor Y. Pan, Soo Go, Qi Luan, Liang Zhao:
Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues. CIAC 2023: 336-352 - Giuseppe Persiano:
The Complexity of Secure RAMs. CIAC 2023: 17-20 - Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach:
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. CIAC 2023: 353-367 - Paul G. Spirakis, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos:
Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models. CIAC 2023: 1-4 - Muhammad Nur Yanhaona, Asswad Sarker Nomaan, Md. Saidur Rahman:
Efficiently Enumerating All Spanning Trees of a Plane 3-Tree - (Extended Abstract). CIAC 2023: 368-382 - Chun Jiang Zhu:
Communication-Efficient Distributed Graph Clustering and Sparsification Under Duplication Models. CIAC 2023: 383-398 - Marios Mavronicolas:
Algorithms and Complexity - 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings. Lecture Notes in Computer Science 13898, Springer 2023, ISBN 978-3-031-30447-7 [contents]
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-15 14:49 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