Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
Restorable Shortest Path Tiebreaking for Edge-Faulty GraphsBodwin, Greg ; Parter, MeravJournal of the ACM, 2023-10, Vol.70 (5), p.1-24, Article 28 [Periódico revisado por pares]New York, NY: ACMTexto completo disponível |
|
2 |
Material Type: Artigo
|
On finding separators in temporal split and permutation graphsMaack, Nicolas ; Molter, Hendrik ; Niedermeier, Rolf ; Renken, MalteJournal of computer and system sciences, 2023-08, Vol.135, p.1-14 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
|
3 |
Material Type: Artigo
|
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-TimeCairo, Massimo ; Rizzi, Romeo ; Tomescu, Alexandru I. ; Zirondelli, Elia C.ACM transactions on algorithms, 2023-12, Vol.20 (1), p.1-26, Article 4 [Periódico revisado por pares]New York, NY: ACMTexto completo disponível |
|
4 |
Material Type: Artigo
|
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-WilliamsIto, Takehiro ; Iwamasa, Yuni ; Kakimura, Naonori ; Kamiyama, Naoyuki ; Kobayashi, Yusuke ; Maezawa, Shun-Ichi ; Nozaki, Yuta ; Okamoto, Yoshio ; Ozeki, KentaACM transactions on algorithms, 2023-02, Vol.19 (1), p.1-22, Article 6 [Periódico revisado por pares]New York, NY: ACMTexto completo disponível |
|
5 |
Material Type: Artigo
|
A note on degree vs gap of Min-Rep Label Cover and improved inapproximability for connectivity problemsManurangsi, PasinInformation processing letters, 2019-05, Vol.145, p.24-29 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
6 |
Material Type: Artigo
|
On Landmark Distances in PolygonsGotsman, C. ; Hormann, K.Computer graphics forum, 2021-08, Vol.40 (5), p.275-287 [Periódico revisado por pares]Oxford: Blackwell Publishing LtdTexto completo disponível |
|
7 |
Material Type: Artigo
|
State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesisYamakami, TomoyukiTheoretical computer science, 2019-12, Vol.798, p.2-22 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
8 |
Material Type: Artigo
|
Connecting a set of circles with minimum sum of radiiChambers, Erin W. ; Fekete, Sándor P. ; Hoffmann, Hella-Franziska ; Marinakis, Dimitri ; Mitchell, Joseph S.B. ; Srinivasan, Venkatesh ; Stege, Ulrike ; Whitesides, SueComputational geometry : theory and applications, 2018-03, Vol.68 (C), p.62-76 [Periódico revisado por pares]Netherlands: Elsevier B.VTexto completo disponível |
|
9 |
Material Type: Artigo
|
On Querying Connected Components in Large Temporal GraphsXie, Haoxuan ; Fang, Yixiang ; Xia, Yuyang ; Luo, Wensheng ; Ma, ChenhaoProceedings of the ACM on management of data, 2023-06, Vol.1 (2), p.1-27 [Periódico revisado por pares]Sem texto completo |
|
10 |
Material Type: Artigo
|
Distance, Origin and Category Constrained PathsTeng, Xu ; Trajcevski, Goce ; Züfle, AndreasACM transactions on spatial algorithms and systems, 2023-09, Vol.9 (3), p.1-27 [Periódico revisado por pares]New York, NY: ACMTexto completo disponível |