Published in: LIPIcs, Volume 143, 19th International Workshop on Algorithms in Bioinformatics (WABI 2019)
Alexandra Gesine Cauer, Gürkan Yardımcı, Jean-Philippe Vert, Nelle Varoquaux, and William Stafford Noble. Inferring Diploid 3D Chromatin Structures from Hi-C Data. In 19th International Workshop on Algorithms in Bioinformatics (WABI 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 143, pp. 11:1-11:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{cauer_et_al:LIPIcs.WABI.2019.11, author = {Cauer, Alexandra Gesine and Yard{\i}mc{\i}, G\"{u}rkan and Vert, Jean-Philippe and Varoquaux, Nelle and Noble, William Stafford}, title = {{Inferring Diploid 3D Chromatin Structures from Hi-C Data}}, booktitle = {19th International Workshop on Algorithms in Bioinformatics (WABI 2019)}, pages = {11:1--11:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-123-8}, ISSN = {1868-8969}, year = {2019}, volume = {143}, editor = {Huber, Katharina T. and Gusfield, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2019.11}, URN = {urn:nbn:de:0030-drops-110418}, doi = {10.4230/LIPIcs.WABI.2019.11}, annote = {Keywords: Genome 3D architecture, chromatin structure, Hi-C, 3D modeling} }
Published in: LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Rong Ge and Tengyu Ma. Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 829-849, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{ge_et_al:LIPIcs.APPROX-RANDOM.2015.829, author = {Ge, Rong and Ma, Tengyu}, title = {{Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {829--849}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-89-7}, ISSN = {1868-8969}, year = {2015}, volume = {40}, editor = {Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.829}, URN = {urn:nbn:de:0030-drops-53394}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.829}, annote = {Keywords: sum of squares, overcomplete tensor decomposition} }
Published in: LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, and Martin Starnberger. Welfare Maximization with Friends-of-Friends Network Externalities. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 90-102, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bhattacharya_et_al:LIPIcs.STACS.2015.90, author = {Bhattacharya, Sayan and Dvor\'{a}k, Wolfgang and Henzinger, Monika and Starnberger, Martin}, title = {{Welfare Maximization with Friends-of-Friends Network Externalities}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {90--102}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.90}, URN = {urn:nbn:de:0030-drops-49066}, doi = {10.4230/LIPIcs.STACS.2015.90}, annote = {Keywords: network externalities, welfare maximization, approximation algorithms} }
Published in: Dagstuhl Seminar Proceedings, Volume 6271, Challenges in Symbolic Computation Software (2006)
Jean-Guillaume Dumas, Clément Pernet, and Jean-Louis Roch. Adaptive Triangular System Solving. In Challenges in Symbolic Computation Software. Dagstuhl Seminar Proceedings, Volume 6271, pp. 1-18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{dumas_et_al:DagSemProc.06271.3, author = {Dumas, Jean-Guillaume and Pernet, Cl\'{e}ment and Roch, Jean-Louis}, title = {{Adaptive Triangular System Solving}}, booktitle = {Challenges in Symbolic Computation Software}, pages = {1--18}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6271}, editor = {Wolfram Decker and Mike Dewar and Erich Kaltofen and Stephen Watt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06271.3}, URN = {urn:nbn:de:0030-drops-7704}, doi = {10.4230/DagSemProc.06271.3}, annote = {Keywords: Adaptive and hybrid algorithms; triangular system solving; parallel and sequential degenerations} }
Feedback for Dagstuhl Publishing