Prof. Dr. Mathias Weller

L. Iersel, M. Jones and M. Weller, "Embedding Phylogenetic Trees in Networks of Low Treewidth" in 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, Shiri Chechik and Gonzalo Navarro and Eva Rotenberg and Grzegorz Herman, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. pp. 69:1–69:14.

DOI

10.4230/LIPIcs.ESA.2022.69

L. Iersel, M. Jones and M. Weller, "Embedding phylogenetic trees in networks of low treewidth" , CoRR, vol. abs/2207.00574, 2022.

DOI

10.48550/arXiv.2207.00574

T. Davot, A. Chateau, R. Fossé, R. Giroudeau and M. Weller, "On a greedy approach for genome scaffolding" , Algorithms Mol. Biol., vol. 17, no. 1, pp. 16, 2022.

DOI

10.1186/s13015-022-00223-x

K. M. Swenson, A. Elghraoui, F. Valafar, S. Mirarab and M. Weller, "Quantifying Hierarchical Conflicts in Homology Statements" in Comparative Genomics - 19th International Conference, RECOMB-CG 2022, La Jolla, CA, USA, May 20-21, 2022, Proceedings, Lingling Jin and Dannie Durand, Eds. Springer, 2022. pp. 146–167.

DOI

10.1007/978-3-031-06220-9_9

C. Scornavacca and M. Weller, "Treewidth-based algorithms for the small parsimony problem on networks" , Algorithms Mol. Biol., vol. 17, no. 1, pp. 15, 2022.

DOI

10.1186/s13015-022-00216-w

T. Davot, A. Chateau, R. Giroudeau, M. Weller and D. Tabary, "Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds" , Algorithmica, vol. 83, no. 7, pp. 2063–2095, 2021.

DOI

10.1007/s00453-021-00819-6

M. Bentert and M. Weller, "Tree Containment With Soft Polytomies" , J. Graph Algorithms Appl., vol. 25, no. 1, pp. 417–436, 2021.

DOI

10.7155/jgaa.00565

C. Scornavacca and M. Weller, "Treewidth-Based Algorithms for the Small Parsimony Problem on Networks" in 21st International Workshop on Algorithms in Bioinformatics, WABI 2021, August 2-4, 2021, Virtual Conference, Alessandra Carbone and Mohammed El-Kebir, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. pp. 6:1–6:21.

DOI

10.4230/LIPIcs.WABI.2021.6

V. Berry, C. Scornavacca and M. Weller, "Scanning Phylogenetic Networks Is NP-hard" 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, Alexander Chatzigeorgiou and Riccardo Dondi and Herodotos Herodotou and Christos A. Kapoutsis and Yannis Manolopoulos and George A. Papadopoulos and Florian Sikora, Eds. Springer, 2020. pp. 519–530.

DOI

10.1007/978-3-030-38919-2_42

N. Morawietz, C. Rehs and M. Weller, "A Timecop's Work Is Harder Than You Think" in 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic, Javier Esparza and Daniel Král', Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. pp. 71:1–71:14.

DOI

10.4230/LIPIcs.MFCS.2020.71

T. Davot, A. Chateau, R. Giroudeau and M. Weller, "Linearizing Genomes: Exact Methods and Local Search" 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, Alexander Chatzigeorgiou and Riccardo Dondi and Herodotos Herodotou and Christos A. Kapoutsis and Yannis Manolopoulos and George A. Papadopoulos and Florian Sikora, Eds. Springer, 2020. pp. 505–518.

DOI

10.1007/978-3-030-38919-2_41

V. Froese, B. J. Jain, M. Rymar and M. Weller, "Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series" , CoRR, vol. abs/1903.03003, 2019.

Weblink

http://arxiv.org/abs/1903.03003

M. Weller, "Listing Conflicting Triples in Optimal Time" , CoRR, vol. abs/1911.11048, 2019.

Weblink

http://arxiv.org/abs/1911.11048

T. Davot, A. Chateau, R. Giroudeau and M. Weller, "New Polynomial-Time Algorithm Around the Scaffolding Problem" in Algorithms for Computational Biology - 6th International Conference, AlCoB 2019, Berkeley, CA, USA, May 28-30, 2019, Proceedings, Ian H. Holmes and Carlos Martín-Vide and Miguel A. Vega-Rodríguez, Eds. Springer, 2019. pp. 25–38.

DOI

10.1007/978-3-030-18174-1_2

L. Bulteau and M. Weller, "Parameterized Algorithms in Bioinformatics: An Overview" , Algorithms, vol. 12, no. 12, pp. 256, 2019.

DOI

10.3390/a12120256

P. Cazals, B. Darties, A. Chateau, R. Giroudeau and M. Weller, "Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs" in Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings, Charles J. Colbourn and Roberto Grossi and Nadia Pisanti, Eds. Springer, 2019. pp. 122–135.

DOI

10.1007/978-3-030-25005-8_11

M. Weller, A. Chateau, C. Dallard and R. Giroudeau, "Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases" , Algorithmica, vol. 80, no. 6, pp. 1771–1803, 2018.

DOI

10.1007/s00453-018-0405-x

M. R. Fellows, L. Jaffke, A. I. Király, F. A. Rosamond and M. Weller, "What is known about Vertex Cover Kernelization?" , CoRR, vol. abs/1811.09429, 2018.

Weblink

http://arxiv.org/abs/1811.09429

M. R. Fellows, L. Jaffke, A. I. Király, F. A. Rosamond and M. Weller, "What Is Known About Vertex Cover Kernelization?" in Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, Hans-Joachim Böckenhauer and Dennis Komm and Walter Unger, Eds. Springer, 2018. pp. 330–356.

DOI

10.1007/978-3-319-98355-4_19

M. Bentert, J. Malík and M. Weller, "Tree Containment With Soft Polytomies" in 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018, June 18-20, 2018, Malmö, Sweden, David Eppstein, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. pp. 9:1–9:14.

DOI

10.4230/LIPIcs.SWAT.2018.9

M. Weller, "Linear-Time Tree Containment in Phylogenetic Networks" in Comparative Genomics - 16th International Conference, RECOMB-CG 2018, Magog-Orford, QC, Canada, October 9-12, 2018, Proceedings, Mathieu Blanchette and Aïda Ouangraoua, Eds. Springer, 2018. pp. 309–323.

DOI

10.1007/978-3-030-00834-5_18

T. Davot, A. Chateau, R. Giroudeau and M. Weller, "On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs" in Comparative Genomics - 16th International Conference, RECOMB-CG 2018, Magog-Orford, QC, Canada, October 9-12, 2018, Proceedings, Mathieu Blanchette and Aïda Ouangraoua, Eds. Springer, 2018. pp. 91–107.

DOI

10.1007/978-3-030-00834-5_5

M. Weller, A. Chateau, R. Giroudeau, J. König and V. Pollet, "On residual approximation in solution extension problems" , J. Comb. Optim., vol. 36, no. 4, pp. 1195–1220, 2018.

DOI

10.1007/s10878-017-0202-5

D. Tabary, T. Davot, M. Weller, A. Chateau and R. Giroudeau, "New Results About the Linearization of Scaffolds Sharing Repeated Contigs" in Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings, Donghyun Kim and R. N. Uma and Alexander Zelikovsky, Eds. Springer, 2018. pp. 94–107.

DOI

10.1007/978-3-030-04651-4_7

B. Darties, N. Champseix, A. Chateau, R. Giroudeau and M. Weller, "Complexity and lowers bounds for Power Edge Set Problem" , J. Discrete Algorithms, vol. 52-53, pp. 70–91, 2018.

DOI

10.1016/j.jda.2018.11.006

N. Cohen, D. Gonçalves, E. J. Kim, C. Paul, I. Sau, D. M. Thilikos and M. Weller, "A polynomial-time algorithm for Outerplanar Diameter Improvement" , J. Comput. Syst. Sci., vol. 89, pp. 315–327, 2017.

DOI

10.1016/j.jcss.2017.05.016

C. Chauve, M. Jones, M. Lafond, C. Scornavacca and M. Weller, "Constructing a Consensus Phylogeny from a Leaf-Removal Distance" , CoRR, vol. abs/1705.05295, 2017.

Weblink

http://arxiv.org/abs/1705.05295

C. Chauve, M. Jones, M. Lafond, C. Scornavacca and M. Weller, "Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract)" in String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings, Gabriele Fici and Marinella Sciortino and Rossano Venturini, Eds. Springer, 2017. pp. 129–143.

DOI

10.1007/978-3-319-67428-5_12

B. Darties, A. Chateau, R. Giroudeau and M. Weller, "Improved Complexity for Power Edge Set Problem" in Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers, Ljiljana Brankovic and Joe Ryan and William F. Smyth, Eds. Springer, 2017. pp. 128–141.

DOI

10.1007/978-3-319-78825-8_11

M. Weller, "Linear-Time Tree Containment in Phylogenetic Networks" , CoRR, vol. abs/1702.06364, 2017.

Weblink

http://arxiv.org/abs/1702.06364

B. Darties, A. Chateau, R. Giroudeau and M. Weller, "New Insights for Power Edge Set Problem" in Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, Xiaofeng Gao and Hongwei Du and Meng Han, Eds. Springer, 2017. pp. 180–194.

DOI

10.1007/978-3-319-71150-8_17

M. Weller, A. Chateau and R. Giroudeau, "On the Linearization of Scaffolds Sharing Repeated Contigs" in Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II, Xiaofeng Gao and Hongwei Du and Meng Han, Eds. Springer, 2017. pp. 509–517.

DOI

10.1007/978-3-319-71147-8_38

E. Jacox, M. Weller, E. Tannier and C. Scornavacca, "Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses" , Bioinform., vol. 33, no. 7, pp. 980–987, 2017.

DOI

10.1093/bioinformatics/btw778

H. Dell, C. Komusiewicz, N. Talmon and M. Weller, "The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration" in 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria, Daniel Lokshtanov and Naomi Nishimura, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. pp. 30:1–30:12.

DOI

10.4230/LIPIcs.IPEC.2017.30

S. Kelk, L. Iersel, C. Scornavacca and M. Weller, "Phylogenetic incongruence through the lens of Monadic Second Order logic" , J. Graph Algorithms Appl., vol. 20, no. 2, pp. 189–215, 2016.

DOI

10.7155/jgaa.00390

M. Weller, A. Chateau, R. Giroudeau, J. König and V. Pollet, "On Residual Approximation in Solution Extension Problems" in Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Hong Kong, China, December 16-18, 2016, Proceedings, T.-H. Hubert Chan and Minming Li and Lusheng Wang, Eds. Springer, 2016. pp. 463–476.

DOI

10.1007/978-3-319-48749-6_34

V. Garnero and M. Weller, "Parameterized certificate dispersal and its variants" , Theor. Comput. Sci., vol. 622, pp. 66–78, 2016.

DOI

10.1016/j.tcs.2016.02.001

C. Dallard, M. Weller, A. Chateau and R. Giroudeau, "Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding" in Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Hong Kong, China, December 16-18, 2016, Proceedings, T.-H. Hubert Chan and Minming Li and Lusheng Wang, Eds. Springer, 2016. pp. 294–308.

DOI

10.1007/978-3-319-48749-6_22

N. Cohen, D. Gonçalves, E. Kim, C. Paul, I. Sau, D. M. Thilikos and M. Weller, "A Polynomial-Time Algorithm for Outerplanar Diameter Improvement" in Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings, Lev D. Beklemishev and Daniil V. Musatov, Eds. Springer, 2015. pp. 123–142.

DOI

10.1007/978-3-319-20297-6_9

R. Bevern, M. Mnich, R. Niedermeier and M. Weller, "Interval scheduling and colorful independent sets" , J. Sched., vol. 18, no. 5, pp. 449–469, 2015.

DOI

10.1007/s10951-014-0398-5

M. A. Babenko, A. V. Goldberg, H. Kaplan, R. Savchenko and M. Weller, "On the Complexity of Hub Labeling" , CoRR, vol. abs/1501.02492, 2015.

Weblink

http://arxiv.org/abs/1501.02492

M. A. Babenko, A. V. Goldberg, H. Kaplan, R. Savchenko and M. Weller, "On the Complexity of Hub Labeling (Extended Abstract)" in Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, Giuseppe F. Italiano and Giovanni Pighizzini and Donald Sannella, Eds. Springer, 2015. pp. 62–74.

DOI

10.1007/978-3-662-48054-0_6

M. Weller, A. Chateau and R. Giroudeau, "On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs" in Combinatorial Optimization and Applications - 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings, Zaixin Lu and Donghyun Kim and Weili Wu and Wei Li and Ding-Zhu Du, Eds. Springer, 2015. pp. 409–423.

DOI

10.1007/978-3-319-26626-8_30

J. Chen, C. Komusiewicz, R. Niedermeier, M. Sorge, O. Suchý and M. Weller, "Polynomial-Time Data Reduction for the Subset Interconnection Design Problem" , SIAM J. Discret. Math., vol. 29, no. 1, pp. 1–25, 2015.

DOI

10.1137/140955057

N. Cohen, D. Gonçalves, E. J. Kim, C. Paul, I. Sau, D. M. Thilikos and M. Weller, "A Polynomial-time Algorithm for Outerplanar Diameter Improvement" , CoRR, vol. abs/1403.5702, 2014.

Weblink

http://arxiv.org/abs/1403.5702

M. Chopin, A. Nichterlein, R. Niedermeier and M. Weller, "Constant Thresholds Can Make Target Set Selection Tractable" , Theory Comput. Syst., vol. 55, no. 1, pp. 61–83, 2014.

DOI

10.1007/s00224-013-9499-3

M. Sorge, H. Moser, R. Niedermeier and M. Weller, "Exploiting a hypergraph model for finding Golomb rulers" , Acta Informatica, vol. 51, no. 7, pp. 449–471, 2014.

DOI

10.1007/s00236-014-0202-1

R. Bevern, M. Mnich, R. Niedermeier and M. Weller, "Interval scheduling and colorful independent sets" , CoRR, vol. abs/1402.0851, 2014.

Weblink

http://arxiv.org/abs/1402.0851

M. Dörnfelder, J. Guo, C. Komusiewicz and M. Weller, "On the parameterized complexity of consensus clustering" , Theor. Comput. Sci., vol. 542, pp. 71–82, 2014.

DOI

10.1016/j.tcs.2014.05.002

M. Weller, "Optimal Hub Labeling is NP-complete" , CoRR, vol. abs/1407.8373, 2014.

Weblink

http://arxiv.org/abs/1407.8373

J. Uhlmann and M. Weller, "Two-Layer Planarization parameterized by feedback edge set" , Theor. Comput. Sci., vol. 494, pp. 99–111, 2013.

DOI

10.1016/j.tcs.2013.01.029

A. Nichterlein, R. Niedermeier, J. Uhlmann and M. Weller, "On tractable cases of Target Set Selection" , Soc. Netw. Anal. Min., vol. 3, no. 2, pp. 233–256, 2013.

DOI

10.1007/s13278-012-0067-7

F. Dorn, H. Moser, R. Niedermeier and M. Weller, "Efficient Algorithms for Eulerian Extension and Rural Postman" , SIAM J. Discret. Math., vol. 27, no. 1, pp. 75–94, 2013.

DOI

10.1137/110834810

J. Chen, C. Komusiewicz, R. Niedermeier, M. Sorge, O. Suchý and M. Weller, "Effective and Efficient Data Reduction for the Subset Interconnection Design Problem" in Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings, Leizhen Cai and Siu-Wing Cheng and Tak Wah Lam, Eds. Springer, 2013. pp. 361–371.

DOI

10.1007/978-3-642-45030-3_34

M. Weller, "An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number" in Experimental Algorithms, 12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013. Proceedings, Vincenzo Bonifaci and Camil Demetrescu and Alberto Marchetti-Spaccamela, Eds. Springer, 2013. pp. 337–353.

DOI

10.1007/978-3-642-38527-8_30

M. Weller, "Aspects of preprocessing applied to combinatorial graph problems", Berlin Institute of Technology, 2013.

ISBN

978-3-7983-2508-1

Weblink

http://opus4.kobv.de/opus4-tuberlin/frontdoor/index/index/docId/3838

M. Sorge, R. Bevern, R. Niedermeier and M. Weller, "A new view on Rural Postman based on Eulerian Extension and Matching" , J. Discrete Algorithms, vol. 16, pp. 12–33, 2012.

DOI

10.1016/j.jda.2012.04.007

M. Chopin, A. Nichterlein, R. Niedermeier and M. Weller, "Constant Thresholds Can Make Target Set Selection Tractable" in Design and Analysis of Algorithms - First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proceedings, Guy Even and Dror Rawitz, Eds. Springer, 2012. pp. 120–133.

DOI

10.1007/978-3-642-34862-4_9

M. Sorge, H. Moser, R. Niedermeier and M. Weller, "Exploiting a Hypergraph Model for Finding Golomb Rulers" in Combinatorial Optimization - Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, Ali Ridha Mahjoub and Vangelis Markakis and Ioannis Milis and Vangelis Th. Paschos, Eds. Springer, 2012. pp. 368–379.

DOI

10.1007/978-3-642-32147-4_33

R. Bevern, M. Mnich, R. Niedermeier and M. Weller, "Interval Scheduling and Colorful Independent Sets" in Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings, Kun-Mao Chao and Tsan-sheng Hsu and Der-Tsai Lee, Eds. Springer, 2012. pp. 247–256.

DOI

10.1007/978-3-642-35261-4_28

M. Weller, C. Komusiewicz, R. Niedermeier and J. Uhlmann, "On making directed graphs transitive" , J. Comput. Syst. Sci., vol. 78, no. 2, pp. 559–574, 2012.

DOI

10.1016/j.jcss.2011.07.001

M. Dörnfelder, J. Guo, C. Komusiewicz and M. Weller, "On the Parameterized Complexity of Consensus Clustering" in Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings, Takao Asano and Shin-Ichi Nakano and Yoshio Okamoto and Osamu Watanabe, Eds. Springer, 2011. pp. 624–633.

DOI

10.1007/978-3-642-25591-5_64

M. Sorge, R. Bevern, R. Niedermeier and M. Weller, "A New View on Rural Postman Based on Eulerian Extension and Matching" in Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, Costas S. Iliopoulos and William F. Smyth, Eds. Springer, 2011. pp. 310–323.

DOI

10.1007/978-3-642-25011-8_25

R. Bevern, S. Hartung, F. Kammer, R. Niedermeier and M. Weller, "Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs" in Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers, Dániel Marx and Peter Rossmanith, Eds. Springer, 2011. pp. 194–206.

DOI

10.1007/978-3-642-28050-4_16

M. Sorge, R. Bevern, R. Niedermeier and M. Weller, "From Few Components to an Eulerian Graph by Adding Arcs" in Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers, Petr Kolman and Jan Kratochvíl, Eds. Springer, 2011. pp. 307–318.

DOI

10.1007/978-3-642-25870-1_28

F. Dorn, H. Moser, R. Niedermeier and M. Weller, "Efficient Algorithms for Eulerian Extension" in Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers, Dimitrios M. Thilikos, Eds. 2010. pp. 100–111.

DOI

10.1007/978-3-642-16926-7_11

R. Fleischer, J. Guo, R. Niedermeier, J. Uhlmann, Y. Wang, M. Weller and X. Wu, "Extended Islands of Tractability for Parsimony Haplotyping" in Combinatorial Pattern Matching, 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings, Amihood Amir and Laxmi Parida, Eds. Springer, 2010. pp. 214–226.

DOI

10.1007/978-3-642-13509-5_20

A. Nichterlein, R. Niedermeier, J. Uhlmann and M. Weller, "On Tractable Cases of Target Set Selection" in Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I, Otfried Cheong and Kyung-Yong Chwa and Kunsoo Park, Eds. Springer, 2010. pp. 378–389.

DOI

10.1007/978-3-642-17517-6_34

J. Uhlmann and M. Weller, "Two-Layer Planarization Parameterized by Feedback Edge Set" in Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings, Jan Kratochvíl and Angsheng Li and Jirí Fiala and Petr Kolman, Eds. Springer, 2010. pp. 431–442.

DOI

10.1007/978-3-642-13562-0_39

M. Weller, C. Komusiewicz, R. Niedermeier and J. Uhlmann, "On Making Directed Graphs Transitive" in Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, Frank K. H. A. Dehne and Marina L. Gavrilova and Jörg-Rüdiger Sack and Csaba D. Tóth, Eds. Springer, 2009. pp. 542–553.

DOI

10.1007/978-3-642-03367-4_47