default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 174
Volume 174, March 2022
- Vassos Hadzilacos, Xing Hu, Sam Toueg:
Randomized consensus with regular registers. 106173 - Yubai Zhang, Zhao Zhang, Zhaohui Liu, Qirong Chen:
An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem. 106177 - Sangram Kishor Jena
, Ramesh K. Jallu, Gautam K. Das:
On d-distance m-tuple (ℓ, r)-domination in graphs. 106178 - Lee-Ad Gottlieb, Aryeh Kontorovich:
Non-uniform packings. 106179 - Pavel Pudlák:
On matrices potentially useful for tree codes. 106180 - Philipp Zschoche:
A faster parameterized algorithm for temporal matching. 106181 - David Tankus:
Weighted well-covered graphs without cycles of lengths 5, 6 and 7. 106189 - Carol T. Zamfirescu:
Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs. 106192 - Mingyu Xiao, Shaowei Kou:
A simple and improved parameterized algorithm for bicluster editing. 106193 - Hyung-Chan An, Robert Kleinberg:
A diameter-revealing proof of the Bondy-Lovász lemma. 106194 - Bünyamin Sahin:
New network entropy: The domination entropy of graphs. 106195 - Janusz Januszewski, Lukasz Zielonka:
Packing batches of items into a single bin. 106196 - Kyoji Shibutani, Tetsu Iwata:
On the (im)possibility of improving the round diffusion of generalized Feistel structures. 106197 - Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho:
Minimum projective linearizations of trees in linear time. 106204 - Greg Bodwin:
A note on distance-preserving graph sparsification. 106205 - Faisal N. Abu-Khzam:
An improved exact algorithm for minimum dominating set in chordal graphs. 106206 - Nirina Andrianarivelo, Pierre Réty:
Modular termination of prefix-constrained term rewrite systems. 106207 - Béatrice Bérard, Serge Haddad:
Revisiting reachability in Polynomial Interrupt Timed Automata. 106208 - Takuro Fukunaga, R. Ravi, Oleksandr Rudenko, Ziye Tang:
Two-level hub Steiner trees. 106209 - Vitor Tocci F. de Luca, Nestaly Marín, Fabiano de S. Oliveira, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Jayme Luiz Szwarcfiter, Jorge Urrutia:
Grid straight-line embeddings of trees with a minimum number of bends per path. 106210 - Asaf Levin:
Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes. 106211 - Ana-Isabel Gómez, Markus Kiderlen, Florian Pausinger:
Improved entropy bounds for parity filtered self-timed ring based random number generators. 106212 - Barnaby Martin, Daniël Paulusma, Siani Smith:
Hard problems that quickly become very easy. 106213
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-11 21:17 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:
