Publications - Current Year

“New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring,” Discrete Mathematics, vol. 347, no. 4, 2024.

@article{Chandran24,
TITLE = {New bounds on the anti-{R}amsey numbers of star graphs via maximum edge q-coloring},
AUTHOR = {Chandran, L. Sunil and Hashim, Talha and Jacob, Dalu and Mathew, Rogers and Rajendraprasad, Deepak and Singh, Nitin},
LANGUAGE = {eng},
ISSN = {0012-365X},
DOI = {10.1016/j.disc.2024.113894},
PUBLISHER = {North-Holland},
ADDRESS = {Amsterdam},
YEAR = {2024},
DATE = {2024},
JOURNAL = {Discrete Mathematics},
VOLUME = {347},
NUMBER = {4},
EID = {113894},
}

%0 Journal Article
%A Chandran, L. Sunil
%A Hashim, Talha
%A Jacob, Dalu
%A Mathew, Rogers
%A Rajendraprasad, Deepak
%A Singh, Nitin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
%T New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-1AB5-8
%R 10.1016/j.disc.2024.113894
%7 2024
%D 2024
%J Discrete Mathematics
%V 347
%N 4
%Z sequence number: 113894
%I North-Holland
%C Amsterdam
%@ false

“Legal Hypergraphs,” Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 382, no. 2270, 2024.

@article{Coupette2024,
TITLE = {Legal Hypergraphs},
AUTHOR = {Coupette, Corinna and Hartung, Dirk and Katz, Daniel Martin},
LANGUAGE = {eng},
ISSN = {1364-503X},
DOI = {10.1098/rsta.2023.0141},
PUBLISHER = {Royal Society},
ADDRESS = {London},
YEAR = {2024},
DATE = {2024},
JOURNAL = {Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences},
VOLUME = {382},
NUMBER = {2270},
PAGES = {1--19},
EID = {20230141},
}

%0 Journal Article
%A Coupette, Corinna
%A Hartung, Dirk
%A Katz, Daniel Martin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Legal Hypergraphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-888E-9
%R 10.1098/rsta.2023.0141
%2 PMC10894694
%D 2024
%J Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
%O Phil. Trans. R. Soc. A
%V 382
%N 2270
%& 1
%P 1 - 19
%Z sequence number: 20230141
%I Royal Society
%C London
%@ false

“Computing Generalized Convolutions Faster Than Brute Force,” Algorithmica, vol. 86, 2024.

@article{Esmer_23,
TITLE = {Computing Generalized Convolutions Faster Than Brute Force},
AUTHOR = {Esmer, Bari{\c s} Can and Kulik, Ariel and Marx, D{\'a}niel and Schepper, Philipp and W{\c e}grzycki, Karol},
LANGUAGE = {eng},
ISSN = {0178-4617},
DOI = {10.1007/s00453-023-01176-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
YEAR = {2024},
DATE = {2024},
JOURNAL = {Algorithmica},
VOLUME = {86},
PAGES = {334--366},
}

%0 Journal Article
%A Esmer, Bariş Can
%A Kulik, Ariel
%A Marx, Dániel
%A Schepper, Philipp
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Computing Generalized Convolutions Faster Than Brute Force : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-36C4-8
%R 10.1007/s00453-023-01176-2
%7 2023
%D 2024
%J Algorithmica
%V 86
%& 334
%P 334 - 366
%I Springer-Verlag
%C New York
%@ false

“On Weighted Graph Separation Problems and Flow-Augmentation,” SIAM Journal on Discrete Mathematics, 2024.

@article{Kim24,
TITLE = {On Weighted Graph Separation Problems and Flow-Augmentation},
AUTHOR = {Kim, Eun Jung and Masa{\v r}{\'i}k, Tom{\'a}{\v s} and Pilipczuk, Marcin and Sharma, Roohani and Wahlstr{\"o}m, Magnus},
LANGUAGE = {eng},
ISSN = {0895-4801},
DOI = {10.1137/22M153118X},
PUBLISHER = {SIAM},
ADDRESS = {Philadelphia, Pa.},
YEAR = {2024},
DATE = {2024},
JOURNAL = {SIAM Journal on Discrete Mathematics},
PAGES = {170--189},
}

%0 Journal Article
%A Kim, Eun Jung
%A Masařík, Tomáš
%A Pilipczuk, Marcin
%A Sharma, Roohani
%A Wahlström, Magnus
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T On Weighted Graph Separation Problems and Flow-Augmentation : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-7599-1
%R 10.1137/22M153118X
%7 2024
%D 2024
%J SIAM Journal on Discrete Mathematics
%& 170
%P 170 - 189
%I SIAM
%C Philadelphia, Pa.
%@ false

Namrata, and A. Williams, “On the Hardness of Gray Code Problems for Combinatorial Objects,” in WALCOM: Algorithms and Computation, Kanazawa, Japan, 2024.

@inproceedings{Merino_WALCOM24,
TITLE = {On the Hardness of Gray Code Problems for Combinatorial Objects},
AUTHOR = {Merino, Arturo and Namrata and Williams, Aaron},
LANGUAGE = {eng},
ISBN = {978-981-97-0565-8},
DOI = {10.1007/978-981-97-0566-5_9},
PUBLISHER = {Springer},
YEAR = {2024},
DATE = {2024},
BOOKTITLE = {WALCOM: Algorithms and Computation},
EDITOR = {Uehara, Ryuhei and Yamanaka, Katsuhisa and Yen, Hsu-Chun},
PAGES = {328--339},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {14549},
ADDRESS = {Kanazawa, Japan},
}

%0 Conference Proceedings
%A Merino, Arturo
%A Namrata, 
%A Williams, Aaron
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T On the Hardness of Gray Code Problems for Combinatorial Objects : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-4EEB-2
%R 10.1007/978-981-97-0566-5_9
%D 2024
%B 18th International Conference and Workshops on Algorithms and
Computation
%Z date of event: 2024-03-18 - 2024-03-20
%C Kanazawa, Japan
%B WALCOM: Algorithms and Computation
%E Uehara, Ryuhei; Yamanaka, Katsuhisa; Yen, Hsu-Chun
%P 328 - 339
%I Springer
%@ 978-981-97-0565-8
%B Lecture Notes in Computer Science
%N 14549
%U https://rdcu.be/dIy4F

“On the Two-Dimensional Knapsack Problem for Convex Polygons,” ACM Transactions on Algorithms, vol. 20, no. 2, 2024.

@article{Merino24,
TITLE = {On the Two-Dimensional Knapsack Problem for Convex Polygons},
AUTHOR = {Merino, Arturo and Wiese, Andreas},
LANGUAGE = {eng},
ISSN = {1549-6325},
DOI = {10.1145/3644390},
PUBLISHER = {ACM},
ADDRESS = {New York, NY},
YEAR = {2024},
DATE = {2024},
JOURNAL = {ACM Transactions on Algorithms},
VOLUME = {20},
NUMBER = {2},
PAGES = {1--38},
EID = {16},
}

%0 Journal Article
%A Merino, Arturo
%A Wiese, Andreas
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T On the Two-Dimensional Knapsack Problem for Convex Polygons : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-5226-A
%R 10.1145/3644390
%7 2024
%D 2024
%J ACM Transactions on Algorithms
%V 20
%N 2
%& 1
%P 1 - 38
%Z sequence number: 16
%I ACM
%C New York, NY
%@ false

“EFX Exists for Three Agents,” Journal of the ACM, vol. 71, no. 1, 2024.

@article{RayChaudhury24,
TITLE = {{EFX} Exists for Three Agents},
AUTHOR = {Ray Chaudhury, Bhaskar and Garg, Jugal and Mehlhorn, Kurt},
LANGUAGE = {eng},
ISSN = {0004-5411},
DOI = {10.1145/3616009},
PUBLISHER = {ACM},
ADDRESS = {New York, NY},
YEAR = {2024},
DATE = {2024},
JOURNAL = {Journal of the ACM},
VOLUME = {71},
NUMBER = {1},
PAGES = {1--27},
EID = {4},
}

%0 Journal Article
%A Ray Chaudhury, Bhaskar
%A Garg, Jugal
%A Mehlhorn, Kurt
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T EFX Exists for Three Agents : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-6961-F
%R 10.1145/3616009
%D 2024
%J Journal of the ACM
%V 71
%N 1
%& 1
%P 1 - 27
%Z sequence number: 4
%I ACM
%C New York, NY
%@ false

“MAP- and MLE-Based Teaching,” Journal of Machine Learning Research, vol. 25, 2024.

@article{Simon24JMLR,
TITLE = {{MAP}- and {MLE}-Based Teaching},
AUTHOR = {Simon, Hans Ulrich and Telle, Jan Arne},
LANGUAGE = {eng},
ISSN = {1532-4435},
URL = {http://jmlr.org/papers/v25/23-1086.html},
PUBLISHER = {Microtome Publishing},
ADDRESS = {Brookline, MA},
YEAR = {2024},
JOURNAL = {Journal of Machine Learning Research},
VOLUME = {25},
PAGES = {1--34},
EID = {96},
}

%0 Journal Article
%A Simon, Hans Ulrich
%A Telle, Jan Arne
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T MAP- and MLE-Based Teaching : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-4ED2-D
%U http://jmlr.org/papers/v25/23-1086.html
%7 2024
%D 2024
%J Journal of Machine Learning Research
%O JMLR
%V 25
%& 1
%P 1 - 34
%Z sequence number: 96
%I Microtome Publishing
%C Brookline, MA
%@ false