Published in: LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
Yosuke Mizutani and Blair D. Sullivan. Parameterized Complexity of Maximum Happy Set and Densest k-Subgraph. In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 23:1-23:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{mizutani_et_al:LIPIcs.IPEC.2022.23, author = {Mizutani, Yosuke and Sullivan, Blair D.}, title = {{Parameterized Complexity of Maximum Happy Set and Densest k-Subgraph}}, booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)}, pages = {23:1--23:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-260-0}, ISSN = {1868-8969}, year = {2022}, volume = {249}, editor = {Dell, Holger and Nederlof, Jesper}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.23}, URN = {urn:nbn:de:0030-drops-173795}, doi = {10.4230/LIPIcs.IPEC.2022.23}, annote = {Keywords: parameterized algorithms, maximum happy set, densest k-subgraph, modular-width, clique-width, neighborhood diversity, cluster deletion number, twin cover} }
Published in: LIPIcs, Volume 227, 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, and Oliver Schaudt. Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. In 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 227, pp. 5:1-5:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{adjiashvili_et_al:LIPIcs.SWAT.2022.5, author = {Adjiashvili, David and Hommelsheim, Felix and M\"{u}hlenthaler, Moritz and Schaudt, Oliver}, title = {{Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults}}, booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)}, pages = {5:1--5:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-236-5}, ISSN = {1868-8969}, year = {2022}, volume = {227}, editor = {Czumaj, Artur and Xin, Qin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.5}, URN = {urn:nbn:de:0030-drops-161659}, doi = {10.4230/LIPIcs.SWAT.2022.5}, annote = {Keywords: graph algorithms, network design, fault tolerance, approximation algorithms} }
Published in: LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Andreas Galanis, Leslie Ann Goldberg, and Andrés Herrera-Poyatos. The Complexity of Approximating the Complex-Valued Potts Model. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 36:1-36:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{galanis_et_al:LIPIcs.MFCS.2020.36, author = {Galanis, Andreas and Goldberg, Leslie Ann and Herrera-Poyatos, Andr\'{e}s}, title = {{The Complexity of Approximating the Complex-Valued Potts Model}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {36:1--36:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.36}, URN = {urn:nbn:de:0030-drops-127038}, doi = {10.4230/LIPIcs.MFCS.2020.36}, annote = {Keywords: approximate counting, Potts model, Tutte polynomial, partition function, complex numbers} }
Published in: LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, and William S. Zwicker. Almost Envy-Free Allocations with Connected Bundles. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 14:1-14:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bilo_et_al:LIPIcs.ITCS.2019.14, author = {Bil\`{o}, Vittorio and Caragiannis, Ioannis and Flammini, Michele and Igarashi, Ayumi and Monaco, Gianpiero and Peters, Dominik and Vinci, Cosimo and Zwicker, William S.}, title = {{Almost Envy-Free Allocations with Connected Bundles}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {14:1--14:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.14}, URN = {urn:nbn:de:0030-drops-101078}, doi = {10.4230/LIPIcs.ITCS.2019.14}, annote = {Keywords: Envy-free Division, Cake-cutting, Resource Allocation, Algorithmic Game Theory} }
Published in: LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch. The Minimum Bisection in the Planted Bisection Model. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 710-725, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{cojaoghlan_et_al:LIPIcs.APPROX-RANDOM.2015.710, author = {Coja-Oghlan, Amin and Cooley, Oliver and Kang, Mihyun and Skubch, Kathrin}, title = {{The Minimum Bisection in the Planted Bisection Model}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {710--725}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.710}, URN = {urn:nbn:de:0030-drops-53315}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.710}, annote = {Keywords: Random graphs, minimum bisection, planted bisection, belief propagation.} }
Published in: Dagstuhl Seminar Proceedings, Volume 10131, Spatial Representation and Reasoning in Language : Ontologies and Logics of Space (2011)
Joana Hois and Oliver Kutz. Towards Linguistically-Grounded Spatial Logics. In Spatial Representation and Reasoning in Language : Ontologies and Logics of Space. Dagstuhl Seminar Proceedings, Volume 10131, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{hois_et_al:DagSemProc.10131.6, author = {Hois, Joana and Kutz, Oliver}, title = {{Towards Linguistically-Grounded Spatial Logics}}, booktitle = {Spatial Representation and Reasoning in Language : Ontologies and Logics of Space}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2011}, volume = {10131}, editor = {John A. Bateman and Anthony G. Cohn and James Pustejovsky}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10131.6}, URN = {urn:nbn:de:0030-drops-27296}, doi = {10.4230/DagSemProc.10131.6}, annote = {Keywords: Spatial Logics, Spatial Language} }
Published in: Dagstuhl Seminar Proceedings, Volume 8141, Organic Computing - Controlled Self-organization (2008)
Andreas Bernauer, Dirk Fritz, Björn Sander, Oliver Bringmann, and Wolfgang Rosenstiel. Current state of ASoC design methodology. In Organic Computing - Controlled Self-organization. Dagstuhl Seminar Proceedings, Volume 8141, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{bernauer_et_al:DagSemProc.08141.6, author = {Bernauer, Andreas and Fritz, Dirk and Sander, Bj\"{o}rn and Bringmann, Oliver and Rosenstiel, Wolfgang}, title = {{Current state of ASoC design methodology}}, booktitle = {Organic Computing - Controlled Self-organization}, pages = {1--17}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8141}, editor = {Kirstie Bellman and Michael G. Hinchey and Christian M\"{u}ller-Schloer and Hartmut Schmeck and Rolf W\"{u}rtz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08141.6}, URN = {urn:nbn:de:0030-drops-15646}, doi = {10.4230/DagSemProc.08141.6}, annote = {Keywords: Dagstuhl Seminar Proceedings, System-on-Chip, design methodology, system reliability, learning classifier system, XCS, ASoC} }
Published in: Dagstuhl Seminar Proceedings, Volume 8191, Graph Drawing with Applications to Bioinformatics and Social Sciences (2008)
Vladimir Batagelj, Franz J. Brandenburg, Walter Didimo, Guiseppe Liotta, and Maurizio Patrignani. 08191 Working Group Report – X-graphs of Y-graphs and their Representations. In Graph Drawing with Applications to Bioinformatics and Social Sciences. Dagstuhl Seminar Proceedings, Volume 8191, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{batagelj_et_al:DagSemProc.08191.5, author = {Batagelj, Vladimir and Brandenburg, Franz J. and Didimo, Walter and Liotta, Guiseppe and Patrignani, Maurizio}, title = {{08191 Working Group Report – X-graphs of Y-graphs and their Representations}}, booktitle = {Graph Drawing with Applications to Bioinformatics and Social Sciences}, pages = {1--17}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8191}, editor = {Stephen P. Borgatti and Stephen Kobourov and Oliver Kohlbacher and Petra Mutzel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08191.5}, URN = {urn:nbn:de:0030-drops-15563}, doi = {10.4230/DagSemProc.08191.5}, annote = {Keywords: Graph drawing, X-graphs of Y-graphs, visualization of large graphs} }
Published in: Dagstuhl Seminar Proceedings, Volume 6291, The Role of Business Processes in Service Oriented Architectures (2006)
Oliver Günther, Gerrit Tamm, and Frank Leymann. Pricing Web Services. In The Role of Business Processes in Service Oriented Architectures. Dagstuhl Seminar Proceedings, Volume 6291, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{gunther_et_al:DagSemProc.06291.12, author = {G\"{u}nther, Oliver and Tamm, Gerrit and Leymann, Frank}, title = {{Pricing Web Services}}, booktitle = {The Role of Business Processes in Service Oriented Architectures}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6291}, editor = {Frank Leymann and Wolfgang Reisig and Satish R. Thatte and Wil van der Aalst}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06291.12}, URN = {urn:nbn:de:0030-drops-8220}, doi = {10.4230/DagSemProc.06291.12}, annote = {Keywords: Composite web services, pricing} }
Published in: Dagstuhl Seminar Proceedings, Volume 5471, Computational Proteomics (2006)
Marc Sturm, Sascha Quinten, Christian G. Huber, and Oliver Kohlbacher. A machine learning approach for prediction of DNA and peptide HPLC retention times. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 5471, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{sturm_et_al:DagSemProc.05471.3, author = {Sturm, Marc and Quinten, Sascha and Huber, Christian G. and Kohlbacher, Oliver}, title = {{A machine learning approach for prediction of DNA and peptide HPLC retention times}}, booktitle = {Computational Proteomics}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5471}, editor = {Christian G. Huber and Oliver Kohlbacher and Knut Reinert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05471.3}, URN = {urn:nbn:de:0030-drops-5484}, doi = {10.4230/DagSemProc.05471.3}, annote = {Keywords: High performance liquid chromatography, mass spectrometry, retention time, prediction, peptide, DNA, support vector regression} }
Published in: Dagstuhl Seminar Proceedings, Volume 5471, Computational Proteomics (2006)
Knut Reinert, Oliver Kohlbacher, Clemens Gröpl, Eva Lange, Ole Schulz-Trieglaff, Marc Sturm, and Nico Pfeifer. OpenMS - A Framework for Quantitative HPLC/MS-Based Proteomics. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 5471, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{reinert_et_al:DagSemProc.05471.13, author = {Reinert, Knut and Kohlbacher, Oliver and Gr\"{o}pl, Clemens and Lange, Eva and Schulz-Trieglaff, Ole and Sturm, Marc and Pfeifer, Nico}, title = {{OpenMS - A Framework for Quantitative HPLC/MS-Based Proteomics}}, booktitle = {Computational Proteomics}, pages = {1--7}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5471}, editor = {Christian G. Huber and Oliver Kohlbacher and Knut Reinert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05471.13}, URN = {urn:nbn:de:0030-drops-5463}, doi = {10.4230/DagSemProc.05471.13}, annote = {Keywords: Proteomics, C++, Differential expression} }
Published in: Dagstuhl Seminar Proceedings, Volume 5471, Computational Proteomics (2006)
Christian G. Huber, Oliver Kohlbacher, and Knut Reinert. 05471 Abstract Collection – Computational Proteomics. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 5471, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{huber_et_al:DagSemProc.05471.1, author = {Huber, Christian G. and Kohlbacher, Oliver and Reinert, Knut}, title = {{05471 Abstract Collection – Computational Proteomics}}, booktitle = {Computational Proteomics}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5471}, editor = {Christian G. Huber and Oliver Kohlbacher and Knut Reinert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05471.1}, URN = {urn:nbn:de:0030-drops-5569}, doi = {10.4230/DagSemProc.05471.1}, annote = {Keywords: Proteomics, mass spectrometry, MALDI, HPLC-MS, differential expression, clinical proteomics, quantitation, identification} }
Published in: Dagstuhl Seminar Proceedings, Volume 5471, Computational Proteomics (2006)
Christian G. Huber, Oliver Kohlbacher, and Knut Reinert. 05471 Executive Summary – Computational Proteomics. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 5471, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{huber_et_al:DagSemProc.05471.2, author = {Huber, Christian G. and Kohlbacher, Oliver and Reinert, Knut}, title = {{05471 Executive Summary – Computational Proteomics}}, booktitle = {Computational Proteomics}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5471}, editor = {Christian G. Huber and Oliver Kohlbacher and Knut Reinert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05471.2}, URN = {urn:nbn:de:0030-drops-5406}, doi = {10.4230/DagSemProc.05471.2}, annote = {Keywords: Proteomics, mass spectrometry, MALDI, HPLC-MS, differential expression, clinical proteomics, quantitation, identification} }
Published in: Dagstuhl Seminar Proceedings, Volume 5471, Computational Proteomics (2006)
Clemens Gröpl. An Algorithm for Feature Finding in LC/MS Raw Data. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 5471, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{gropl:DagSemProc.05471.4, author = {Gr\"{o}pl, Clemens}, title = {{An Algorithm for Feature Finding in LC/MS Raw Data}}, booktitle = {Computational Proteomics}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5471}, editor = {Christian G. Huber and Oliver Kohlbacher and Knut Reinert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05471.4}, URN = {urn:nbn:de:0030-drops-5341}, doi = {10.4230/DagSemProc.05471.4}, annote = {Keywords: Computational Proteomics, Quantitative Analysis, Liquid Chromatography, Mass Spectrometry, Algorithm, Software} }
Published in: Dagstuhl Seminar Proceedings, Volume 5471, Computational Proteomics (2006)
Sebastian Böcker and Veli Mäkinen. Combinatorial Approaches for Mass Spectra Recalibration. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 5471, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{bocker_et_al:DagSemProc.05471.5, author = {B\"{o}cker, Sebastian and M\"{a}kinen, Veli}, title = {{Combinatorial Approaches for Mass Spectra Recalibration}}, booktitle = {Computational Proteomics}, pages = {1--6}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5471}, editor = {Christian G. Huber and Oliver Kohlbacher and Knut Reinert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05471.5}, URN = {urn:nbn:de:0030-drops-5455}, doi = {10.4230/DagSemProc.05471.5}, annote = {Keywords: Mass spectrometry recalibration computational geometry} }
Feedback for Dagstuhl Publishing