Current Year
[1]
I. Anagnostides, T. Gouleakis, and A. Marashian, “Robust Learning under Strong Noise via SQs,” in Proceedings of the Twenty Fourth International Conference on Artificial Intelligence and Statistics (AISTATS 2021), Virtual Conference. (Accepted/in press)
Export
BibTeX
@inproceedings{Anagnostides_AISTATS2020,
TITLE = {Robust Learning under Strong Noise via {SQs}},
AUTHOR = {Anagnostides, Ioannis and Gouleakis, Themis and Marashian, Ali},
LANGUAGE = {eng},
PUBLISHER = {PMLR},
YEAR = {2021},
PUBLREMARK = {Accepted},
MARGINALMARK = {$\bullet$},
BOOKTITLE = {Proceedings of the Twenty Fourth International Conference on Artificial Intelligence and Statistics (AISTATS 2021)},
SERIES = {Proceedings of the Machine Learning Research},
ADDRESS = {Virtual Conference},
}
Endnote
%0 Conference Proceedings
%A Anagnostides, Ioannis
%A Gouleakis, Themis
%A Marashian, Ali
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Robust Learning under Strong Noise via SQs :
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-DBCD-C
%D 2021
%B 24th International Conference on Artificial Intelligence and Statistics
%Z date of event: 2021-04-13 - 2021-04-15
%C Virtual Conference
%B Proceedings of the Twenty Fourth International Conference on Artificial Intelligence and Statistics
%I PMLR
%B Proceedings of the Machine Learning Research
[2]
K. Axiotis, A. Backurs, K. Bringmann, C. Jin, V. Nakos, C. Tzamos, and H. Wu, “Fast and Simple Modular Subset Sum,” in SIAM Symposium on Simplicity in Algorithms (SOSA 2021), Alexandria, VA, USA (Virtual Conference). (Accepted/in press)
Export
BibTeX
@inproceedings{Axiotis_SOSA2020,
TITLE = {Fast and Simple Modular Subset Sum},
AUTHOR = {Axiotis, Kyriakos and Backurs, Arturs and Bringmann, Karl and Jin, Ce and Nakos, Vasileios and Tzamos, Christos and Wu, Hongxun},
LANGUAGE = {eng},
YEAR = {2021},
PUBLREMARK = {Accepted},
MARGINALMARK = {$\bullet$},
BOOKTITLE = {SIAM Symposium on Simplicity in Algorithms (SOSA 2021)},
ADDRESS = {Alexandria, VA, USA (Virtual Conference)},
}
Endnote
%0 Conference Proceedings
%A Axiotis, Kyriakos
%A Backurs, Arturs
%A Bringmann, Karl
%A Jin, Ce
%A Nakos, Vasileios
%A Tzamos, Christos
%A Wu, Hongxun
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Fast and Simple Modular Subset Sum :
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-56CF-0
%D 2020
%B SIAM Symposium on Simplicity in Algorithms
%Z date of event: 2021-01-11 - 2021-01-12
%C Alexandria, VA, USA (Virtual Conference)
%B SIAM Symposium on Simplicity in Algorithms
[3]
B. A. Berendsohn, L. Kozma, and D. Marx, “Finding and Counting Permutations via CSPs,” Algorithmica, vol. 148, 2021.
Export
BibTeX
@article{berendsohn2021,
TITLE = {Finding and Counting Permutations via {CSPs}},
AUTHOR = {Berendsohn, Benjamin Aram and Kozma, L{\'a}szl{\'o} and Marx, D{\'a}niel},
LANGUAGE = {eng},
ISSN = {0178-4617},
DOI = {10.1007/s00453-021-00812-z},
PUBLISHER = {Springer},
ADDRESS = {New York, NY},
YEAR = {2021},
MARGINALMARK = {$\bullet$},
JOURNAL = {Algorithmica},
VOLUME = {148},
}
Endnote
%0 Journal Article
%A Berendsohn, Benjamin Aram
%A Kozma, László
%A Marx, Dániel
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Finding and Counting Permutations via CSPs :
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-3403-A
%R 10.1007/s00453-021-00812-z
%7 2021
%D 2021
%J Algorithmica
%V 148
%I Springer
%C New York, NY
%@ false
[4]
K. Bringmann and P. Wellnitz, “On Near-Linear-Time Algorithms for Dense Subset Sum,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Bringmann_SODA21,
TITLE = {On Near-Linear-Time Algorithms for Dense Subset Sum},
AUTHOR = {Bringmann, Karl and Wellnitz, Philip},
LANGUAGE = {eng},
ISBN = {978-1-61197-646-5},
DOI = {10.1137/1.9781611976465.107},
PUBLISHER = {SIAM},
YEAR = {2021},
MARGINALMARK = {$\bullet$},
DATE = {2021},
BOOKTITLE = {Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021)},
EDITOR = {Marx, D{\'a}niel},
PAGES = {1777--1796},
ADDRESS = {Alexandria, VA, USA (Virtual Conference)},
}
Endnote
%0 Conference Proceedings
%A Bringmann, Karl
%A Wellnitz, Philip
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T On Near-Linear-Time Algorithms for Dense Subset Sum :
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-8C7E-F
%R 10.1137/1.9781611976465.107
%D 2021
%B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2021-01-10 - 2021-01-13
%C Alexandria, VA, USA (Virtual Conference)
%B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms
%E Marx, Dániel
%P 1777 - 1796
%I SIAM
%@ 978-1-61197-646-5
[5]
K. Bringmann and V. Nakos, “A Fine-Grained Perspective on Approximating Subset Sum and Partition,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Bringmann_SODA21b,
TITLE = {A Fine-Grained Perspective on Approximating Subset Sum and Partition},
AUTHOR = {Bringmann, Karl and Nakos, Vasileios},
LANGUAGE = {eng},
ISBN = {978-1-61197-646-5},
DOI = {10.1137/1.9781611976465.108},
PUBLISHER = {SIAM},
YEAR = {2021},
MARGINALMARK = {$\bullet$},
DATE = {2021},
BOOKTITLE = {Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021)},
EDITOR = {Marx, D{\'a}niel},
PAGES = {1797--1815},
ADDRESS = {Alexandria, VA, USA (Virtual Conference)},
}
Endnote
%0 Conference Proceedings
%A Bringmann, Karl
%A Nakos, Vasileios
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T A Fine-Grained Perspective on Approximating Subset Sum and Partition :
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-90DD-D
%R 10.1137/1.9781611976465.108
%D 2021
%B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2021-01-10 - 2021-01-13
%C Alexandria, VA, USA (Virtual Conference)
%B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms
%E Marx, Dániel
%P 1797 - 1815
%I SIAM
%@ 978-1-61197-646-5
[6]
P. Charalampopoulos, T. Kociumaka, and P. Wellnitz, “Faster Approximate Pattern Matching: A Unified Approach,” in FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science, Durham, NC, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Charalampopoulos_FOCS2020,
TITLE = {Faster Approximate Pattern Matching: {A} Unified Approach},
AUTHOR = {Charalampopoulos, Panagiotis and Kociumaka, Tomasz and Wellnitz, Philip},
LANGUAGE = {eng},
ISBN = {978-1-7281-9621-3},
DOI = {10.1109/FOCS46700.2020},
PUBLISHER = {IEEE},
YEAR = {2020},
MARGINALMARK = {$\bullet$},
DATE = {2021},
BOOKTITLE = {FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science},
PAGES = {978--989},
ADDRESS = {Durham, NC, USA (Virtual Conference)},
}
Endnote
%0 Conference Proceedings
%A Charalampopoulos, Panagiotis
%A Kociumaka, Tomasz
%A Wellnitz, Philip
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Faster Approximate Pattern Matching: A Unified Approach :
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-8C66-9
%R 10.1109/FOCS46700.2020
%D 2021
%B 61st Annual IEEE Symposium on Foundations of Computer Science
%Z date of event: 2020-11-16 - 2020-11-19
%C Durham, NC, USA (Virtual Conference)
%B FOCS 2020
%P 978 - 989
%I IEEE
%@ 978-1-7281-9621-3
[7]
M. Cheraghchi and V. Nakos, “Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time,” in FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science, Durham, NC, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Cheraghchi_FOCS2020,
TITLE = {Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time},
AUTHOR = {Cheraghchi, Mahdi and Nakos, Vasileios},
LANGUAGE = {eng},
ISBN = {978-1-7281-9621-3},
DOI = {10.1109/FOCS46700.2020},
PUBLISHER = {IEEE},
YEAR = {2020},
MARGINALMARK = {$\bullet$},
DATE = {2021},
BOOKTITLE = {FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science},
PAGES = {1203--1213},
ADDRESS = {Durham, NC, USA (Virtual Conference)},
}
Endnote
%0 Conference Proceedings
%A Cheraghchi, Mahdi
%A Nakos, Vasileios
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time :
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-56C6-9
%R 10.1109/FOCS46700.2020
%D 2021
%B 61st Annual IEEE Symposium on Foundations of Computer Science
%Z date of event: 2020-11-16 - 2020-11-19
%C Durham, NC, USA (Virtual Conference)
%B FOCS 2020
%P 1203 - 1213
%I IEEE
%@ 978-1-7281-9621-3
[8]
C. Coupette and C. Lenzen, “A Breezing Proof of the KMW Bound,” in SIAM Symposium on Simplicity in Algorithms (SOSA 2021), Alexandria, VA, USA (Virtual Conference). (Accepted/in press)
Export
BibTeX
@inproceedings{Coupette_SOSA2020,
TITLE = {A Breezing Proof of the {KMW} Bound},
AUTHOR = {Coupette, Corinna and Lenzen, Christoph},
LANGUAGE = {eng},
YEAR = {2021},
PUBLREMARK = {Accepted},
MARGINALMARK = {$\bullet$},
BOOKTITLE = {SIAM Symposium on Simplicity in Algorithms (SOSA 2021)},
ADDRESS = {Alexandria, VA, USA (Virtual Conference)},
}
Endnote
%0 Conference Proceedings
%A Coupette, Corinna
%A Lenzen, Christoph
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T A Breezing Proof of the KMW Bound :
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-7A44-4
%D 2020
%B SIAM Symposium on Simplicity in Algorithms
%Z date of event: 2021-01-11 - 2021-01-12
%C Alexandria, VA, USA (Virtual Conference)
%B SIAM Symposium on Simplicity in Algorithms
[9]
A. M. Feit, M. Nancel, M. John, A. Karrenbauer, D. Weir, and A. Oulasvirta, “AZERTY Amélioré: Computational Design on a National Scale,” Communications of the ACM, vol. 64, no. 2, 2021.
Export
BibTeX
@article{FNJKWO2021,
TITLE = {{AZERTY} Am\'{e}lior\'{e}: {C}omputational Design on a National Scale},
AUTHOR = {Feit, Anna Maria and Nancel, Mathieu and John, Maximilian and Karrenbauer, Andreas and Weir, Daryl and Oulasvirta, Antti},
LANGUAGE = {eng},
ISSN = {0001-0782},
DOI = {10.1145/3382035},
PUBLISHER = {Association for Computing Machinery, Inc.},
ADDRESS = {New York},
YEAR = {2021},
MARGINALMARK = {$\bullet$},
JOURNAL = {Communications of the ACM},
VOLUME = {64},
NUMBER = {2},
PAGES = {48--58},
}
Endnote
%0 Journal Article
%A Feit, Anna Maria
%A Nancel, Mathieu
%A John, Maximilian
%A Karrenbauer, Andreas
%A Weir, Daryl
%A Oulasvirta, Antti
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T AZERTY Amélioré: Computational Design on a National Scale :
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-E78E-5
%R 10.1145/3382035
%7 2021
%D 2021
%K {F}r\'{e}chet
%J Communications of the ACM
%V 64
%N 2
%& 48
%P 48 - 58
%I Association for Computing Machinery, Inc.
%C New York
%@ false
[10]
M. Grohe, D. Neuen, and D. Wiebking, “Isomorphism Testing for Graphs Excluding Small Minors,” in FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science, Durham, NC, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Grohe_FOCS2020,
TITLE = {Isomorphism Testing for Graphs Excluding Small Minors},
AUTHOR = {Grohe, Martin and Neuen, Daniel and Wiebking, Daniel},
LANGUAGE = {eng},
ISBN = {978-1-7281-9621-3},
DOI = {10.1109/FOCS46700.2020.00064},
PUBLISHER = {IEEE},
YEAR = {2020},
MARGINALMARK = {$\bullet$},
DATE = {2021},
BOOKTITLE = {FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science},
PAGES = {625--636},
ADDRESS = {Durham, NC, USA (Virtual Conference)},
}
Endnote
%0 Conference Proceedings
%A Grohe, Martin
%A Neuen, Daniel
%A Wiebking, Daniel
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Isomorphism Testing for Graphs Excluding Small Minors :
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-9947-D
%R 10.1109/FOCS46700.2020.00064
%D 2021
%B 61st Annual IEEE Symposium on Foundations of Computer Science
%Z date of event: 2020-11-16 - 2020-11-19
%C Durham, NC, USA (Virtual Conference)
%B FOCS 2020
%P 625 - 636
%I IEEE
%@ 978-1-7281-9621-3
[11]
D. Lokshtanov, P. Misra, M. S. Ramanujan, S. Saurabh, and M. Zehavi, “FPT-approximation for FPT Problems,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{FPTApprox21,
TITLE = {{FPT}-approximation for {FPT} Problems},
AUTHOR = {Lokshtanov, Daniel and Misra, Pranabendu and Ramanujan, M. S. and Saurabh, Saket and Zehavi, Meirav},
LANGUAGE = {eng},
ISBN = {978-1-61197-646-5},
DOI = {10.1137/1.9781611976465.14},
PUBLISHER = {SIAM},
YEAR = {2021},
MARGINALMARK = {$\bullet$},
DATE = {2021},
BOOKTITLE = {Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021)},
EDITOR = {Marx, D{\'a}niel},
PAGES = {199--218},
ADDRESS = {Alexandria, VA, USA (Virtual Conference)},
}
Endnote
%0 Conference Proceedings
%A Lokshtanov, Daniel
%A Misra, Pranabendu
%A Ramanujan, M. S.
%A Saurabh, Saket
%A Zehavi, Meirav
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T FPT-approximation for FPT Problems :
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-D2AE-8
%R 10.1137/1.9781611976465.14
%D 2021
%B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2021-01-10 - 2021-01-13
%C Alexandria, VA, USA (Virtual Conference)
%B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms
%E Marx, Dániel
%P 199 - 218
%I SIAM
%@ 978-1-61197-646-5
[12]
J. Madathil, R. Sharma, and M. Zehavi, “A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs,” Algorithmica, 2021.
Export
BibTeX
@article{Madathil2021,
TITLE = {A Sub-exponential {FPT} Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs},
AUTHOR = {Madathil, Jayakrishnan and Sharma, Roohani and Zehavi, Meirav},
LANGUAGE = {eng},
ISSN = {0178-4617},
DOI = {10.1007/s00453-021-00806-x},
PUBLISHER = {Springer},
ADDRESS = {New York, NY},
YEAR = {2021},
MARGINALMARK = {$\bullet$},
JOURNAL = {Algorithmica},
}
Endnote
%0 Journal Article
%A Madathil, Jayakrishnan
%A Sharma, Roohani
%A Zehavi, Meirav
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs :
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-2C54-9
%R 10.1007/s00453-021-00806-x
%7 2021
%D 2021
%J Algorithmica
%I Springer
%C New York, NY
%@ false
[13]
B. Ray Chaudhury, J. Garg, P. McGlaughlin, and R. Mehta, “Competitive Allocation of a Mixed Manna,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Chaudhury_SODA21,
TITLE = {Competitive Allocation of a Mixed Manna},
AUTHOR = {Ray Chaudhury, Bhaskar and Garg, Jugal and McGlaughlin, Peter and Mehta, Ruta},
LANGUAGE = {eng},
ISBN = {978-1-61197-646-5},
DOI = {10.1137/1.9781611976465.85},
PUBLISHER = {SIAM},
YEAR = {2021},
MARGINALMARK = {$\bullet$},
DATE = {2021},
BOOKTITLE = {Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021)},
EDITOR = {Marx, D{\'a}niel},
PAGES = {1405--1424},
ADDRESS = {Alexandria, VA, USA (Virtual Conference)},
}
Endnote
%0 Conference Proceedings
%A Ray Chaudhury, Bhaskar
%A Garg, Jugal
%A McGlaughlin, Peter
%A Mehta, Ruta
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Competitive Allocation of a Mixed Manna :
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-9365-1
%R 10.1137/1.9781611976465.85
%D 2021
%B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2021-01-10 - 2021-01-13
%C Alexandria, VA, USA (Virtual Conference)
%B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms
%E Marx, Dániel
%P 1405 - 1424
%I SIAM
%@ 978-1-61197-646-5
[14]
B. Ray Chaudhury, J. Garg, and R. Mehta, “Fair and Efficient Allocations under Subadditive Valuations,” in Thirty-Fifth AAAI Conference on Artificial Intelligence, Virtual Conference. (Accepted/in press)
Export
BibTeX
@inproceedings{Chaudhury_AAAI21,
TITLE = {Fair and Efficient Allocations under Subadditive Valuations},
AUTHOR = {Ray Chaudhury, Bhaskar and Garg, Jugal and Mehta, Ruta},
LANGUAGE = {eng},
PUBLISHER = {AAAI},
YEAR = {2021},
PUBLREMARK = {Accepted},
MARGINALMARK = {$\bullet$},
BOOKTITLE = {Thirty-Fifth AAAI Conference on Artificial Intelligence},
ADDRESS = {Virtual Conference},
}
Endnote
%0 Conference Proceedings
%A Ray Chaudhury, Bhaskar
%A Garg, Jugal
%A Mehta, Ruta
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Fair and Efficient Allocations under Subadditive Valuations :
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-9370-4
%D 2020
%B Thirty-Fifth AAAI Conference on Artificial Intelligence
%Z date of event: 2021-02-02 - 2021-02-09
%C Virtual Conference
%B Thirty-Fifth AAAI Conference on Artificial Intelligence
%I AAAI
[15]
M. Roth, J. Schmitt, and P. Wellnitz, “Counting Small Induced Subgraphs Satisfying Monotone Properties,” in FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science, Durham, NC, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Roth_FOCS2020,
TITLE = {Counting Small Induced Subgraphs Satisfying Monotone Properties},
AUTHOR = {Roth, Marc and Schmitt, Johannes and Wellnitz, Philip},
LANGUAGE = {eng},
ISBN = {978-1-7281-9621-3},
DOI = {10.1109/FOCS46700.2020},
PUBLISHER = {IEEE},
YEAR = {2020},
MARGINALMARK = {$\bullet$},
DATE = {2021},
BOOKTITLE = {FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science},
PAGES = {1356--1367},
ADDRESS = {Durham, NC, USA (Virtual Conference)},
}
Endnote
%0 Conference Proceedings
%A Roth, Marc
%A Schmitt, Johannes
%A Wellnitz, Philip
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Counting Small Induced Subgraphs Satisfying Monotone Properties :
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-8C5E-3
%R 10.1109/FOCS46700.2020
%D 2021
%B 61st Annual IEEE Symposium on Foundations of Computer Science
%Z date of event: 2020-11-16 - 2020-11-19
%C Durham, NC, USA (Virtual Conference)
%B FOCS 2020
%P 1356 - 1367
%I IEEE
%@ 978-1-7281-9621-3
[16]
K. Vitting Klinkby, P. Misra, and S. Saurabh, “Strong Connectivity Augmentation is FPT,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{SCAug21,
TITLE = {Strong Connectivity Augmentation is {FPT}},
AUTHOR = {Vitting Klinkby, Kristine and Misra, Pranabendu and Saurabh, Saket},
LANGUAGE = {eng},
ISBN = {978-1-61197-646-5},
DOI = {10.1137/1.9781611976465.15},
PUBLISHER = {SIAM},
YEAR = {2021},
MARGINALMARK = {$\bullet$},
DATE = {2021},
BOOKTITLE = {Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021)},
EDITOR = {Marx, D{\'a}niel},
PAGES = {219--234},
ADDRESS = {Alexandria, VA, USA (Virtual Conference)},
}
Endnote
%0 Conference Proceedings
%A Vitting Klinkby, Kristine
%A Misra, Pranabendu
%A Saurabh, Saket
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Strong Connectivity Augmentation is FPT :
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-D2A6-0
%R 10.1137/1.9781611976465.15
%D 2021
%B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2021-01-10 - 2021-01-13
%C Alexandria, VA, USA (Virtual Conference)
%B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms
%E Marx, Dániel
%P 219 - 234
%I SIAM
%@ 978-1-61197-646-5