default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCSR 2022: Virtual Event
- Alexander S. Kulikov
, Sofya Raskhodnikova:
Computer Science - Theory and Applications - 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 - July 1, 2022, Proceedings. Lecture Notes in Computer Science 13296, Springer 2022, ISBN 978-3-031-09573-3 - Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
Parameterized Algorithms for Finding Highly Connected Solution. 1-16 - Abidha V. P, Pradeesha Ashok, Avi Tomar, Dolly Yadav:
Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring. 17-34 - Pavel Alaev:
Quotient Structures and Groups Computable in Polynomial Time. 35-45 - Bardiya Aryanfard, Fahad Panolan:
Parameterized Complexity of List Coloring and Max Coloring. 46-63 - Jasine Babu, Neeldhara Misra, Saraswati Nanoti:
Eternal Vertex Cover on Bipartite Graphs. 64-76 - Lorenzo Balzotti, Paolo Giulio Franciosa:
Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time. 77-95 - Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
Lossy Kernelization of Same-Size Clustering. 96-114 - Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh:
Output Sensitive Fault Tolerant Maximum Matching. 115-132 - Laurent Doyen, Marie van den Bogaard:
Bounds for Synchronizing Markov Decision Processes. 133-151 - Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh:
Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. 152-169 - Alexander Grishutin, Daniil Musatov:
Discrete Versions of the KKM Lemma and Their PPAD-Completeness. 170-189 - Kamil Khadiev, Maxim Yagafarov:
The Fast Algorithm for Online k-server Problem on Trees. 190-208 - Peter Kostolányi:
Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields. 209-223 - Alexander Kozachinskiy:
New Bounds for the Flock-of-Birds Problem. 224-237 - Yifen Li, Xiaohui Bei, Youming Qiao, Dacheng Tao, Zhiya Chen:
Heterogeneous Multi-commodity Network Flows over Time. 238-255 - Mizuhito Ogawa, Alexander Okhotin:
On the Determinization of Event-Clock Input-Driven Pushdown Automata. 256-268 - Pierre Ohlmann:
The GKK Algorithm is the Fastest over Simple Mean-Payoff Games. 269-288 - Fahad Panolan, Hannane Yaghoubizade:
Partial Vertex Cover on Graphs of Bounded Degeneracy. 289-301 - Elena A. Petrova, Arseny M. Shur:
Abelian Repetition Threshold Revisited. 302-319 - Thomas Place, Marc Zeitoun:
Characterizing Level One in Group-Based Concatenation Hierarchies. 320-337 - Nikolai K. Vereshchagin:
How Much Randomness is Needed to Convert MA Protocols to AM Protocols? 338-349
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.
last updated on 2024-11-08 20:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
