jo.\*:("Algorithmica")
Results 1 to 25 of 1547
Selection :
2-Layer Right Angle Crossing DrawingsDI GIACOMO, Emilio; DIDIMO, Walter; EADES, Peter et al.Algorithmica. 2014, Vol 68, Num 4, pp 954-997, issn 0178-4617, 44 p.Article
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided TiesIWAMA, Kazuo; MIYAZAKI, Shuichi; YANAGISAWA, Hiroki et al.Algorithmica. 2014, Vol 68, Num 3, pp 758-775, issn 0178-4617, 18 p.Article
Analysis of Agglomerative ClusteringACKERMANN, Marcel R; BLÖMER, Johannes; KUNTZE, Daniel et al.Algorithmica. 2014, Vol 69, Num 1, pp 184-215, issn 0178-4617, 32 p.Article
Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter TractableKELK, Steven; SCORNAVACCA, Celine.Algorithmica. 2014, Vol 68, Num 4, pp 886-915, issn 0178-4617, 30 p.Article
Enumerating Minimal Subset Feedback Vertex SetsFOMIN, Fedor V; HEGGERNES, Pinar; KRATSCH, Dieter et al.Algorithmica. 2014, Vol 69, Num 1, pp 216-231, issn 0178-4617, 16 p.Article
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning TreeBILO, Davide; GUALA, Luciano; PROIETTI, Guido et al.Algorithmica. 2014, Vol 68, Num 2, pp 337-357, issn 0178-4617, 21 p.Article
Inclusion/Exclusion Meets Measure and ConquerNEDERLOF, Jesper; VAN ROOIJ, Johan M. M; VAN DIJK, Thomas C et al.Algorithmica. 2014, Vol 69, Num 3, pp 685-740, issn 0178-4617, 56 p.Article
Limitations of Incremental Dynamic ProgrammingJUKNA, Stasys.Algorithmica. 2014, Vol 69, Num 2, pp 461-492, issn 0178-4617, 32 p.Article
Multicommodity Flow in Trees: Packing via Covering and Iterated RelaxationKÖNEMANN, Jochen; PAREKH, Ojas; PRITCHARD, David et al.Algorithmica. 2014, Vol 68, Num 3, pp 776-804, issn 0178-4617, 29 p.Article
On the Advantage of Overlapping Clusters for Minimizing ConductanceKHANDEKAR, Rohit; KORTSARZ, Guy; MIRROKNI, Vahab et al.Algorithmica. 2014, Vol 69, Num 4, pp 844-863, issn 0178-4617, 20 p.Article
On the Complexity of Strongly Connected Components in Directed HypergraphsALLAMIGEON, Xavier.Algorithmica. 2014, Vol 69, Num 2, pp 335-369, issn 0178-4617, 35 p.Article
Opaque SetsDUMITRESCU, Adrian; MINGHUI JIANG; PACH, János et al.Algorithmica. 2014, Vol 69, Num 2, pp 315-334, issn 0178-4617, 20 p.Article
Outlier Respecting Points ApproximationCHEN, Danny Z; HAITAO WANG.Algorithmica. 2014, Vol 69, Num 2, pp 410-430, issn 0178-4617, 21 p.Article
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets : Algorithms and ComputationMENG HE; IAN MUNRO, J; GELIN ZHOU et al.Algorithmica. 2014, Vol 70, Num 4, pp 696-717, issn 0178-4617, 22 p.Article
A Randomized Sieving Algorithm for Approximate Integer ProgrammingDADUSH, Daniel.Algorithmica. 2014, Vol 70, Num 2, pp 208-244, issn 0178-4617, 37 p.Conference Paper
Lower Bounds Against Weakly-Uniform Threshold CircuitsRUIWEN CHEN; KABANETS, Valentine; KINNE, Jeff et al.Algorithmica. 2014, Vol 70, Num 1, pp 47-75, issn 0178-4617, 29 p.Conference Paper
A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded StringsCHEN, Kuan-Yu; CHAO, Kun-Mao.Algorithmica. 2013, Vol 65, Num 2, pp 354-370, issn 0178-4617, 17 p.Article
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted GraphsBASWANA, Surender; KHANNA, Neelesh.Algorithmica. 2013, Vol 66, Num 1, pp 18-50, issn 0178-4617, 33 p.Article
How to Use Spanning Trees to Navigate in GraphsDRAGAN, Feodor F; YANG XIANG.Algorithmica. 2013, Vol 66, Num 3, pp 479-511, issn 0178-4617, 33 p.Article
I/O Efficient Dynamic Data Structures for Longest Prefix QueriesHERSHCOVITCH, Moshe; KAPLAN, Haim.Algorithmica. 2013, Vol 65, Num 2, pp 371-390, issn 0178-4617, 20 p.Article
Median TrajectoriesBUCHIN, Kevin; BUCHIN, Maike; KREVELD, Marc Van et al.Algorithmica. 2013, Vol 66, Num 3, pp 595-614, issn 0178-4617, 20 p.Article
Online Speed Scaling Based on Active Job Count to Minimize Flow Plus EnergyLAM, Tak-Wah; LEE, Lap-Kei; TO, Isaac K. K et al.Algorithmica. 2013, Vol 65, Num 3, pp 605-633, issn 0178-4617, 29 p.Article
PASS Approximation: A Framework for Analyzing and Designing HeuristicsFEIGE, Uriel; IMMORLICA, Nicole; MIRROKNI, Vahab S et al.Algorithmica. 2013, Vol 66, Num 2, pp 450-478, issn 0178-4617, 29 p.Article
On the Grundy and b-Chromatic Numbers of a GraphHAVET, Frédéric; SAMPAIO, Leonardo.Algorithmica. 2013, Vol 65, Num 4, pp 885-899, issn 0178-4617, 15 p.Article
Improved Constructions for Non-adaptive Threshold Group TestingCHERAGHCHI, Mahdi.Algorithmica. 2013, Vol 67, Num 3, pp 384-417, issn 0178-4617, 34 p.Article