skip to main content
Language:
Primo Advanced Search
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search prefilters
Simple Search
Results 1 2 3 4 5 next page
Show only
Refined by: Journal Title: Acm Transactions On Algorithms remove
Result Number Material Type Add to My Shelf Action Record Details and Options
1
Exact Algorithms for Terrain Guarding
Exact Algorithms for Terrain Guarding
Material Type:
Article 		Add to e-Shelf

Exact Algorithms for Terrain Guarding

Ashok, Pradeesha ; Fomin, Fedor ; Kolay, Sudeshna ; Saurabh, Saket ; Zehavi, Meirav

ACM transactions on algorithms, 2018-06, Vol.14 (2), p.1-20 [Peer Reviewed Journal]

ACM

Full text available

Citations Cited by
2
Approximation Schemes for Low-rank Binary Matrix Approximation Problems
Approximation Schemes for Low-rank Binary Matrix Approximation Problems
Material Type:
Article 		Add to e-Shelf

Approximation Schemes for Low-rank Binary Matrix Approximation Problems

Fomin, Fedor ; Golovach, Petr ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket

ACM transactions on algorithms, 2020-01, Vol.16 (1), p.1-39 [Peer Reviewed Journal]

ACM

Full text available

Citations Cited by
3
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
Material Type:
Article 		Add to e-Shelf

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems

Fomin, Fedor ; Lokshtanov, Daniel ; Kolay, Sudeshna ; Panolan, Fahad ; Saurabh, Saket

ACM transactions on algorithms, 2020-04, Vol.16 (2), p.1-37 [Peer Reviewed Journal]

ACM

Full text available

Citations Cited by
4
Representative Families of Product Families
Representative Families of Product Families
Material Type:
Article 		Add to e-Shelf

Representative Families of Product Families

Fomin, Fedor ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket

ACM transactions on algorithms, 2017-08, Vol.13 (3), p.1-29 [Peer Reviewed Journal]

ACM

Full text available

Citations Cited by
5
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors
Material Type:
Article 		Add to e-Shelf

Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors

Fomin, Fedor ; Lokshtanov, Daniel ; Saurabh, Saket ; Thilikos, Dimitrios

ACM transactions on algorithms, 2018-01, Vol.14 (1), p.1-31 [Peer Reviewed Journal]

ACM

Full text available

Citations Cited by
6
Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
Material Type:
Article 		Add to e-Shelf

Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs

Demaine, Erik ; Fomin, Fedor ; Hajiaghayi, Mohammadtaghi ; Thilikos, Dimitrios

ACM transactions on algorithms, 2005-07, Vol.1 (1), p.33-47 [Peer Reviewed Journal]

ACM

Full text available

Citations Cited by
7
Subexponential Parameterized Algorithm for I nterval C ompletion
Subexponential Parameterized Algorithm for I nterval C ompletion
Material Type:
Article 		Add to e-Shelf

Subexponential Parameterized Algorithm for I nterval C ompletion

Bliznets, Ivan ; Fomin, Fedor ; Pilipczuk, Marcin ; Pilipczuk, MichaŁ

ACM transactions on algorithms, 2018-07, Vol.14 (3), p.1-62 [Peer Reviewed Journal]

ACM

Full text available

Citations Cited by
8
Kernel(s) for problems with no kernel: On out-trees with many leaves
Kernel(s) for problems with no kernel: On out-trees with many leaves
Material Type:
Article 		Add to e-Shelf

Kernel(s) for problems with no kernel: On out-trees with many leaves

Binkele-Raible, Daniel ; Fernau, Henning ; Fomin, Fedor ; Lokshtanov, Daniel ; Saurabh, Saket ; Villanger, Yngve

ACM transactions on algorithms, 2012-09, Vol.8 (4), p.1-19 [Peer Reviewed Journal]

ACM

Full text available

Citations Cited by
9
Spanning Circuits in Regular Matroids
Spanning Circuits in Regular Matroids
Material Type:
Article 		Add to e-Shelf

Spanning Circuits in Regular Matroids

Fomin, Fedor ; Golovach, Petr ; Lokshtanov, Daniel ; Saurabh, Saket

ACM transactions on algorithms, 2019-10, Vol.15 (4), p.1-38 [Peer Reviewed Journal]

ACM

Full text available

Citations Cited by
10
Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring
Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring
Material Type:
Article 		Add to e-Shelf

Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring

Fomin, Fedor ; Golovach, Petr ; Lokshtanov, Daniel ; Saurabh, Saket ; Zehavi, Meirav

ACM transactions on algorithms, 2019-01, Vol.15 (1), p.1-27 [Peer Reviewed Journal]

ACM

Full text available

Citations Cited by
Results 1 2 3 4 5 next page

  • Implemented by: ABCD-USP USP   Social Network Logos: Freepik

Searching Remote Databases, Please Wait

  • Searching for
  • inscope:(USP_VIDEOS),scope:("PRIMO"),scope:(USP_FISICO),scope:(USP_EREVISTAS),scope:(USP),scope:(USP_EBOOKS),scope:(USP_PRODUCAO),primo_central_multiple_fe
  • Show me what you have so far