generated by bibbase.org
  2022 (4)
Treewidth-based algorithms for the small parsimony problem on networks. Scornavacca, C.; and Weller, M. Algorithms Mol. Biol., 17(1): 15. 2022.
Treewidth-based algorithms for the small parsimony problem on networks [link]Paper   doi   link   bibtex  
Embedding Phylogenetic Trees in Networks of Low Treewidth. van Iersel, L.; Jones, M.; and Weller, M. In 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, pages 69:1–69:14, 2022.
Embedding Phylogenetic Trees in Networks of Low Treewidth [link]Paper   doi   link   bibtex  
Quantifying Hierarchical Conflicts in Homology Statements. Swenson, K. M.; Elghraoui, A.; Valafar, F.; Mirarab, S.; and Weller, M. In Comparative Genomics - 19th International Conference, RECOMB-CG 2022, La Jolla, CA, USA, May 20-21, 2022, Proceedings, pages 146–167, 2022.
Quantifying Hierarchical Conflicts in Homology Statements [link]Paper   doi   link   bibtex  
Embedding phylogenetic trees in networks of low treewidth. van Iersel, L.; Jones, M.; and Weller, M. CoRR, abs/2207.00574. 2022.
Embedding phylogenetic trees in networks of low treewidth [link]Paper   doi   link   bibtex  
  2021 (3)
Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds. Davot, T.; Chateau, A.; Giroudeau, R.; Weller, M.; and Tabary, D. Algorithmica, 83(7): 2063–2095. 2021.
Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds [link]Paper   doi   link   bibtex  
Tree Containment With Soft Polytomies. Bentert, M.; and Weller, M. J. Graph Algorithms Appl., 25(1): 417–436. 2021.
Tree Containment With Soft Polytomies [link]Paper   doi   link   bibtex  
Treewidth-Based Algorithms for the Small Parsimony Problem on Networks. Scornavacca, C.; and Weller, M. In 21st International Workshop on Algorithms in Bioinformatics, WABI 2021, August 2-4, 2021, Virtual Conference, pages 6:1–6:21, 2021.
Treewidth-Based Algorithms for the Small Parsimony Problem on Networks [link]Paper   doi   link   bibtex  
  2020 (3)
A Timecop's Work Is Harder Than You Think. Morawietz, N.; Rehs, C.; and Weller, M. In 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic, pages 71:1–71:14, 2020.
A Timecop's Work Is Harder Than You Think [link]Paper   doi   link   bibtex  
Linearizing Genomes: Exact Methods and Local Search. Davot, T.; Chateau, A.; Giroudeau, R.; and Weller, M. In SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings, pages 505–518, 2020.
Linearizing Genomes: Exact Methods and Local Search [link]Paper   doi   link   bibtex  
Scanning Phylogenetic Networks Is NP-hard. Berry, V.; Scornavacca, C.; and Weller, M. In SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings, pages 519–530, 2020.
Scanning Phylogenetic Networks Is NP-hard [link]Paper   doi   link   bibtex  
  2019 (5)
Parameterized Algorithms in Bioinformatics: An Overview. Bulteau, L.; and Weller, M. Algorithms, 12(12): 256. 2019.
Parameterized Algorithms in Bioinformatics: An Overview [link]Paper   doi   link   bibtex  
New Polynomial-Time Algorithm Around the Scaffolding Problem. Davot, T.; Chateau, A.; Giroudeau, R.; and Weller, M. In Algorithms for Computational Biology - 6th International Conference, AlCoB 2019, Berkeley, CA, USA, May 28-30, 2019, Proceedings, pages 25–38, 2019.
New Polynomial-Time Algorithm Around the Scaffolding Problem [link]Paper   doi   link   bibtex  
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. Cazals, P.; Darties, B.; Chateau, A.; Giroudeau, R.; and Weller, M. In Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings, pages 122–135, 2019.
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs [link]Paper   doi   link   bibtex  
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series. Froese, V.; Jain, B. J.; Rymar, M.; and Weller, M. CoRR, abs/1903.03003. 2019.
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series [link]Paper   link   bibtex  
Listing Conflicting Triples in Optimal Time. Weller, M. CoRR, abs/1911.11048. 2019.
Listing Conflicting Triples in Optimal Time [link]Paper   link   bibtex  
  2018 (9)
Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. Weller, M.; Chateau, A.; Dallard, C.; and Giroudeau, R. Algorithmica, 80(6): 1771–1803. 2018.
Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases [link]Paper   doi   link   bibtex  
On residual approximation in solution extension problems. Weller, M.; Chateau, A.; Giroudeau, R.; König, J.; and Pollet, V. J. Comb. Optim., 36(4): 1195–1220. 2018.
On residual approximation in solution extension problems [link]Paper   doi   link   bibtex  
Complexity and lowers bounds for Power Edge Set Problem. Darties, B.; Champseix, N.; Chateau, A.; Giroudeau, R.; and Weller, M. J. Discrete Algorithms, 52-53: 70–91. 2018.
Complexity and lowers bounds for Power Edge Set Problem [link]Paper   doi   link   bibtex  
What Is Known About Vertex Cover Kernelization?. Fellows, M. R.; Jaffke, L.; Király, A. I.; Rosamond, F. A.; and Weller, M. In Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, pages 330–356, 2018.
What Is Known About Vertex Cover Kernelization? [link]Paper   doi   link   bibtex  
New Results About the Linearization of Scaffolds Sharing Repeated Contigs. Tabary, D.; Davot, T.; Weller, M.; Chateau, A.; and Giroudeau, R. In Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings, pages 94–107, 2018.
New Results About the Linearization of Scaffolds Sharing Repeated Contigs [link]Paper   doi   link   bibtex  
On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs. Davot, T.; Chateau, A.; Giroudeau, R.; and Weller, M. In Comparative Genomics - 16th International Conference, RECOMB-CG 2018, Magog-Orford, QC, Canada, October 9-12, 2018, Proceedings, pages 91–107, 2018.
On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs [link]Paper   doi   link   bibtex  
Linear-Time Tree Containment in Phylogenetic Networks. Weller, M. In Comparative Genomics - 16th International Conference, RECOMB-CG 2018, Magog-Orford, QC, Canada, October 9-12, 2018, Proceedings, pages 309–323, 2018.
Linear-Time Tree Containment in Phylogenetic Networks [link]Paper   doi   link   bibtex  
Tree Containment With Soft Polytomies. Bentert, M.; Malík, J.; and Weller, M. In 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018, June 18-20, 2018, Malmö, Sweden, pages 9:1–9:14, 2018.
Tree Containment With Soft Polytomies [link]Paper   doi   link   bibtex  
What is known about Vertex Cover Kernelization?. Fellows, M. R.; Jaffke, L.; Király, A. I.; Rosamond, F. A.; and Weller, M. CoRR, abs/1811.09429. 2018.
What is known about Vertex Cover Kernelization? [link]Paper   link   bibtex  
  2017 (9)
Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses. Jacox, E.; Weller, M.; Tannier, E.; and Scornavacca, C. Bioinform., 33(7): 980–987. 2017.
Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses [link]Paper   doi   link   bibtex  
A polynomial-time algorithm for Outerplanar Diameter Improvement. Cohen, N.; Gonçalves, D.; Kim, E. J.; Paul, C.; Sau, I.; Thilikos, D. M.; and Weller, M. J. Comput. Syst. Sci., 89: 315–327. 2017.
A polynomial-time algorithm for Outerplanar Diameter Improvement [link]Paper   doi   link   bibtex  
New Insights for Power Edge Set Problem. Darties, B.; Chateau, A.; Giroudeau, R.; and Weller, M. In Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, pages 180–194, 2017.
New Insights for Power Edge Set Problem [link]Paper   doi   link   bibtex  
On the Linearization of Scaffolds Sharing Repeated Contigs. Weller, M.; Chateau, A.; and Giroudeau, R. In Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II, pages 509–517, 2017.
On the Linearization of Scaffolds Sharing Repeated Contigs [link]Paper   doi   link   bibtex  
Improved Complexity for Power Edge Set Problem. Darties, B.; Chateau, A.; Giroudeau, R.; and Weller, M. In Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers, pages 128–141, 2017.
Improved Complexity for Power Edge Set Problem [link]Paper   doi   link   bibtex  
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. Dell, H.; Komusiewicz, C.; Talmon, N.; and Weller, M. In 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria, pages 30:1–30:12, 2017.
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration [link]Paper   doi   link   bibtex  
Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract). Chauve, C.; Jones, M.; Lafond, M.; Scornavacca, C.; and Weller, M. In String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings, pages 129–143, 2017.
Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract) [link]Paper   doi   link   bibtex  
Linear-Time Tree Containment in Phylogenetic Networks. Weller, M. CoRR, abs/1702.06364. 2017.
Linear-Time Tree Containment in Phylogenetic Networks [link]Paper   link   bibtex  
Constructing a Consensus Phylogeny from a Leaf-Removal Distance. Chauve, C.; Jones, M.; Lafond, M.; Scornavacca, C.; and Weller, M. CoRR, abs/1705.05295. 2017.
Constructing a Consensus Phylogeny from a Leaf-Removal Distance [link]Paper   link   bibtex  
  2016 (4)
Phylogenetic incongruence through the lens of Monadic Second Order logic. Kelk, S.; van Iersel, L.; Scornavacca, C.; and Weller, M. J. Graph Algorithms Appl., 20(2): 189–215. 2016.
Phylogenetic incongruence through the lens of Monadic Second Order logic [link]Paper   doi   link   bibtex  
Parameterized certificate dispersal and its variants. Garnero, V.; and Weller, M. Theor. Comput. Sci., 622: 66–78. 2016.
Parameterized certificate dispersal and its variants [link]Paper   doi   link   bibtex  
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. Dallard, C.; Weller, M.; Chateau, A.; and Giroudeau, R. In Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Hong Kong, China, December 16-18, 2016, Proceedings, pages 294–308, 2016.
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding [link]Paper   doi   link   bibtex  
On Residual Approximation in Solution Extension Problems. Weller, M.; Chateau, A.; Giroudeau, R.; König, J.; and Pollet, V. In Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Hong Kong, China, December 16-18, 2016, Proceedings, pages 463–476, 2016.
On Residual Approximation in Solution Extension Problems [link]Paper   doi   link   bibtex  
  2015 (6)
Interval scheduling and colorful independent sets. van Bevern, R.; Mnich, M.; Niedermeier, R.; and Weller, M. J. Sched., 18(5): 449–469. 2015.
Interval scheduling and colorful independent sets [link]Paper   doi   link   bibtex  
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. Chen, J.; Komusiewicz, C.; Niedermeier, R.; Sorge, M.; Suchý, O.; and Weller, M. SIAM J. Discret. Math., 29(1): 1–25. 2015.
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem [link]Paper   doi   link   bibtex  
On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. Weller, M.; Chateau, A.; and Giroudeau, R. In Combinatorial Optimization and Applications - 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings, pages 409–423, 2015.
On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs [link]Paper   doi   link   bibtex  
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. Cohen, N.; Gonçalves, D.; Kim, E.; Paul, C.; Sau, I.; Thilikos, D. M.; and Weller, M. In Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings, pages 123–142, 2015.
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement [link]Paper   doi   link   bibtex  
On the Complexity of Hub Labeling (Extended Abstract). Babenko, M. A.; Goldberg, A. V.; Kaplan, H.; Savchenko, R.; and Weller, M. In Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, pages 62–74, 2015.
On the Complexity of Hub Labeling (Extended Abstract) [link]Paper   doi   link   bibtex  
On the Complexity of Hub Labeling. Babenko, M. A.; Goldberg, A. V.; Kaplan, H.; Savchenko, R.; and Weller, M. CoRR, abs/1501.02492. 2015.
On the Complexity of Hub Labeling [link]Paper   link   bibtex  
  2014 (6)
Exploiting a hypergraph model for finding Golomb rulers. Sorge, M.; Moser, H.; Niedermeier, R.; and Weller, M. Acta Informatica, 51(7): 449–471. 2014.
Exploiting a hypergraph model for finding Golomb rulers [link]Paper   doi   link   bibtex  
Constant Thresholds Can Make Target Set Selection Tractable. Chopin, M.; Nichterlein, A.; Niedermeier, R.; and Weller, M. Theory Comput. Syst., 55(1): 61–83. 2014.
Constant Thresholds Can Make Target Set Selection Tractable [link]Paper   doi   link   bibtex  
On the parameterized complexity of consensus clustering. Dörnfelder, M.; Guo, J.; Komusiewicz, C.; and Weller, M. Theor. Comput. Sci., 542: 71–82. 2014.
On the parameterized complexity of consensus clustering [link]Paper   doi   link   bibtex  
Interval scheduling and colorful independent sets. van Bevern, R.; Mnich, M.; Niedermeier, R.; and Weller, M. CoRR, abs/1402.0851. 2014.
Interval scheduling and colorful independent sets [link]Paper   link   bibtex  
A Polynomial-time Algorithm for Outerplanar Diameter Improvement. Cohen, N.; Gonçalves, D.; Kim, E. J.; Paul, C.; Sau, I.; Thilikos, D. M.; and Weller, M. CoRR, abs/1403.5702. 2014.
A Polynomial-time Algorithm for Outerplanar Diameter Improvement [link]Paper   link   bibtex  
Optimal Hub Labeling is NP-complete. Weller, M. CoRR, abs/1407.8373. 2014.
Optimal Hub Labeling is NP-complete [link]Paper   link   bibtex  
  2013 (6)
Aspects of preprocessing applied to combinatorial graph problems. Weller, M. Ph.D. Thesis, Berlin Institute of Technology, 2013.
Aspects of preprocessing applied to combinatorial graph problems [link]Paper   link   bibtex  
Efficient Algorithms for Eulerian Extension and Rural Postman. Dorn, F.; Moser, H.; Niedermeier, R.; and Weller, M. SIAM J. Discret. Math., 27(1): 75–94. 2013.
Efficient Algorithms for Eulerian Extension and Rural Postman [link]Paper   doi   link   bibtex  
On tractable cases of Target Set Selection. Nichterlein, A.; Niedermeier, R.; Uhlmann, J.; and Weller, M. Soc. Netw. Anal. Min., 3(2): 233–256. 2013.
On tractable cases of Target Set Selection [link]Paper   doi   link   bibtex  
Two-Layer Planarization parameterized by feedback edge set. Uhlmann, J.; and Weller, M. Theor. Comput. Sci., 494: 99–111. 2013.
Two-Layer Planarization parameterized by feedback edge set [link]Paper   doi   link   bibtex  
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. Chen, J.; Komusiewicz, C.; Niedermeier, R.; Sorge, M.; Suchý, O.; and Weller, M. In Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings, pages 361–371, 2013.
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem [link]Paper   doi   link   bibtex  
An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number. Weller, M. In Experimental Algorithms, 12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013. Proceedings, pages 337–353, 2013.
An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number [link]Paper   doi   link   bibtex  
  2012 (5)
On making directed graphs transitive. Weller, M.; Komusiewicz, C.; Niedermeier, R.; and Uhlmann, J. J. Comput. Syst. Sci., 78(2): 559–574. 2012.
On making directed graphs transitive [link]Paper   doi   link   bibtex  
A new view on Rural Postman based on Eulerian Extension and Matching. Sorge, M.; van Bevern, R.; Niedermeier, R.; and Weller, M. J. Discrete Algorithms, 16: 12–33. 2012.
A new view on Rural Postman based on Eulerian Extension and Matching [link]Paper   doi   link   bibtex  
Interval Scheduling and Colorful Independent Sets. van Bevern, R.; Mnich, M.; Niedermeier, R.; and Weller, M. In Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings, pages 247–256, 2012.
Interval Scheduling and Colorful Independent Sets [link]Paper   doi   link   bibtex  
Exploiting a Hypergraph Model for Finding Golomb Rulers. Sorge, M.; Moser, H.; Niedermeier, R.; and Weller, M. In Combinatorial Optimization - Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, pages 368–379, 2012.
Exploiting a Hypergraph Model for Finding Golomb Rulers [link]Paper   doi   link   bibtex  
Constant Thresholds Can Make Target Set Selection Tractable. Chopin, M.; Nichterlein, A.; Niedermeier, R.; and Weller, M. In Design and Analysis of Algorithms - First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proceedings, pages 120–133, 2012.
Constant Thresholds Can Make Target Set Selection Tractable [link]Paper   doi   link   bibtex  
  2011 (4)
On the Parameterized Complexity of Consensus Clustering. Dörnfelder, M.; Guo, J.; Komusiewicz, C.; and Weller, M. In Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings, pages 624–633, 2011.
On the Parameterized Complexity of Consensus Clustering [link]Paper   doi   link   bibtex  
A New View on Rural Postman Based on Eulerian Extension and Matching. Sorge, M.; van Bevern, R.; Niedermeier, R.; and Weller, M. In Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, pages 310–323, 2011.
A New View on Rural Postman Based on Eulerian Extension and Matching [link]Paper   doi   link   bibtex  
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. van Bevern, R.; Hartung, S.; Kammer, F.; Niedermeier, R.; and Weller, M. In Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers, pages 194–206, 2011.
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs [link]Paper   doi   link   bibtex  
From Few Components to an Eulerian Graph by Adding Arcs. Sorge, M.; van Bevern, R.; Niedermeier, R.; and Weller, M. In Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers, pages 307–318, 2011.
From Few Components to an Eulerian Graph by Adding Arcs [link]Paper   doi   link   bibtex  
  2010 (4)
Extended Islands of Tractability for Parsimony Haplotyping. Fleischer, R.; Guo, J.; Niedermeier, R.; Uhlmann, J.; Wang, Y.; Weller, M.; and Wu, X. In Combinatorial Pattern Matching, 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings, pages 214–226, 2010.
Extended Islands of Tractability for Parsimony Haplotyping [link]Paper   doi   link   bibtex  
On Tractable Cases of Target Set Selection. Nichterlein, A.; Niedermeier, R.; Uhlmann, J.; and Weller, M. In Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I, pages 378–389, 2010.
On Tractable Cases of Target Set Selection [link]Paper   doi   link   bibtex  
Two-Layer Planarization Parameterized by Feedback Edge Set. Uhlmann, J.; and Weller, M. In Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings, pages 431–442, 2010.
Two-Layer Planarization Parameterized by Feedback Edge Set [link]Paper   doi   link   bibtex  
Efficient Algorithms for Eulerian Extension. Dorn, F.; Moser, H.; Niedermeier, R.; and Weller, M. In Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers, pages 100–111, 2010.
Efficient Algorithms for Eulerian Extension [link]Paper   doi   link   bibtex  
  2009 (1)
On Making Directed Graphs Transitive. Weller, M.; Komusiewicz, C.; Niedermeier, R.; and Uhlmann, J. In Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, pages 542–553, 2009.
On Making Directed Graphs Transitive [link]Paper   doi   link   bibtex