2025
- Y. C. 0001, A. Gilyén, and R. de Wolf, “A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix.,” in SODA, 2025.
[Bibtex]@inproceedings{sodaChenGW25, author = {Yanlin Chen 0001 and András Gilyén and Ronald de Wolf}, title = {A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix.}, booktitle = {SODA}, year = 2025, keywords = {ELTE and international} } - S. Bhore, B. Keszegh, A. Kupavskii, H. L. 0001, A. Louvet, Dömötör. Pálvölgyi, and C. D. Tóth, “Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers.,” in SODA, 2025.
[Bibtex]@inproceedings{sodaBhoreKK0LPT25, author = {Sujoy Bhore and Balázs Keszegh and Andrey Kupavskii and Hung Le 0001 and Alexandre Louvet and Dömötör Pálvölgyi and Csaba D. Tóth}, title = {Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers.}, booktitle = {SODA}, year = 2025, keywords = {Rényi and international} } - S. Pettie and G. Tardos, “A Refutation of the Pach-Tardos Conjecture for 0-1 Matrices.,” in SODA, 2025.
[Bibtex]@inproceedings{sodaPettieT25, author = {Seth Pettie and Gábor Tardos}, title = {A Refutation of the Pach-Tardos Conjecture for 0-1 Matrices.}, booktitle = {SODA}, year = 2025, keywords = {Rényi and mostly_hungarian} }
2024
- E. R. Bérczi-Kovács, P. Gyimesi, B. Vass, and J. Tapolcai, “Efficient Algorithm for Region-Disjoint Survivable Routing in Backbone Networks.,” in INFOCOM, 2024.
[Bibtex]@inproceedings{infocomBerczi-KovacsGV24, author = {Erika R. Bérczi-Kovács and Péter Gyimesi and Balázs Vass and János Tapolcai}, title = {Efficient Algorithm for Region-Disjoint Survivable Routing in Backbone Networks.}, booktitle = {INFOCOM}, year = 2024, keywords = {ELTE and BME and all_hungarian} } - G. Csáji, D. F. Manlove, I. McBride, and J. T. 0001, “Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples.,” in IJCAI, 2024.
[Bibtex]@inproceedings{ijcaiCsajiMM024, author = {Gergely Csáji and David F. Manlove and Iain McBride and James Trimble 0001}, title = {Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples.}, booktitle = {IJCAI}, year = 2024, keywords = {ELTE and international} } - S. Pettie and G. Tardos, “On the Extremal Functions of Acyclic Forbidden 0-1 Matrices.,” in SODA, 2024.
[Bibtex]@inproceedings{sodaPettieT24, author = {Seth Pettie and Gábor Tardos}, title = {On the Extremal Functions of Acyclic Forbidden 0-1 Matrices.}, booktitle = {SODA}, year = 2024, keywords = {Rényi and mostly_hungarian} } - G. Ivanyos, E. J. Mendoza, Y. Qiao, X. Sun, and C. Zhang, “Faster Isomorphism Testing of p-Groups of Frattini Class 2.,” in FOCS, 2024.
[Bibtex]@inproceedings{focsIvanyosMQSZ24, author = {Gábor Ivanyos and Euan J. Mendoza and Youming Qiao and Xiaorui Sun and Chuanqi Zhang}, title = {Faster Isomorphism Testing of p-Groups of Frattini Class 2.}, booktitle = {FOCS}, year = 2024, keywords = {SZTAKI and international} }
2023
- D. M. Kelen, M. Petreczky, P. Kersch, and A. A. Benczúr, “Theoretical Evaluation of Asymmetric Shapley Values for Root-Cause Analysis.,” in ICDM, 2023.
[Bibtex]@inproceedings{icdmKelenPKB23, author = {Domokos M. Kelen and Mihály Petreczky and Péter Kersch and András A. Benczúr}, title = {Theoretical Evaluation of Asymmetric Shapley Values for Root-Cause Analysis.}, booktitle = {ICDM}, year = 2023, keywords = {BME and SZTAKI and mostly_hungarian} } - M. Oldenhof, G. Ács, B. Pejó, A. Schuffenhauer, N. Holway, N. Sturm, A. Dieckmann, O. Fortmeier, E. Boniface, C. Mayer, A. Gohier, P. Schmidtke, R. Niwayama, D. Kopecky, L. H. Mervin, P. C. Rathi, L. Friedrich, A. Formanek, P. Antal, J. Rahaman, A. Zalewski, W. Heyndrickx, E. Oluoch, M. Stößel, M. Vanco, D. Endico, F. Gelus, T. de Boisfossé, A. Darbier, A. Nicollet, M. Blottière, M. Telenczuk, V. T. Nguyen, T. Martinez, C. Boillet, K. Moutet, A. Picosson, A. Gasser, I. Djafar, A. Simon, A. Arany, J. Simm, Y. Moreau, O. Engkvist, H. Ceulemans, C. Marini, and M. Galtier, “Industry-Scale Orchestrated Federated Learning for Drug Discovery.,” in AAAI, 2023.
[Bibtex]@inproceedings{aaaiOldenhofAPSHSDF23, author = {Martijn Oldenhof and Gergely Ács and Balázs Pejó and Ansgar Schuffenhauer and Nicholas Holway and Noé Sturm and Arne Dieckmann and Oliver Fortmeier and Eric Boniface and Clément Mayer and Arnaud Gohier and Peter Schmidtke and Ritsuya Niwayama and Dieter Kopecky and Lewis H. Mervin and Prakash Chandra Rathi and Lukas Friedrich and András Formanek and Peter Antal and Jordon Rahaman and Adam Zalewski and Wouter Heyndrickx and Ezron Oluoch and Manuel Stößel and Michal Vanco and David Endico and Fabien Gelus and Thaïs de Boisfossé and Adrien Darbier and Ashley Nicollet and Matthieu Blottière and Maria Telenczuk and Van Tien Nguyen and Thibaud Martinez and Camille Boillet and Kelvin Moutet and Alexandre Picosson and Aurélien Gasser and Inal Djafar and Antoine Simon and Adam Arany and Jaak Simm and Yves Moreau and Ola Engkvist and Hugo Ceulemans and Camille Marini and Mathieu Galtier}, title = {Industry-Scale Orchestrated Federated Learning for Drug Discovery.}, booktitle = {AAAI}, year = 2023, keywords = {BME and international} } - J. Tapolcai, P. Babarczi, P. Ho, and L. Rónyai, “Resilient Routing Table Computation Based on Connectivity Preserving Graph Sequences.,” in INFOCOM, 2023.
[Bibtex]@inproceedings{infocomTapolcaiBHR23, author = {János Tapolcai and Péter Babarczi and Pin-Han Ho and Lajos Rónyai}, title = {Resilient Routing Table Computation Based on Connectivity Preserving Graph Sequences.}, booktitle = {INFOCOM}, year = 2023, keywords = {BME and mostly_hungarian} } - V. Addanki, M. Pacut, A. Pourdamghani, G. Rétvári, S. S. 0001, and J. Vanerio, “Self-Adjusting Partially Ordered Lists.,” in INFOCOM, 2023.
[Bibtex]@inproceedings{infocomAddankiPPRSV23, author = {Vamsi Addanki and Maciej Pacut and Arash Pourdamghani and Gábor Rétvári and Stefan Schmid 0001 and Juan Vanerio}, title = {Self-Adjusting Partially Ordered Lists.}, booktitle = {INFOCOM}, year = 2023, keywords = {BME and international} } - D. Barath, D. Rozumnyi, I. Eichhardt, L. Hajder, and J. Matas, “Finding Geometric Models by Clustering in the Consensus Space.,” in CVPR, 2023.
[Bibtex]@inproceedings{cvprBarathREHM23, author = {Daniel Barath and Denys Rozumnyi and Ivan Eichhardt and Levente Hajder and Jiri Matas}, title = {Finding Geometric Models by Clustering in the Consensus Space.}, booktitle = {CVPR}, year = 2023, keywords = {ELTE and international} } - L. Hajder, L. Lóczi, and D. Barath, “Fast Globally Optimal Surface Normal from an Affine Correspondence.,” in ICCV, 2023.
[Bibtex]@inproceedings{iccvHajderLB23, author = {Levente Hajder and Lajos Lóczi and Daniel Barath}, title = {Fast Globally Optimal Surface Normal from an Affine Correspondence.}, booktitle = {ICCV}, year = 2023, keywords = {ELTE and mostly_hungarian} } - J. van Apeldoorn, A. Cornelissen, A. Gilyén, and G. Nannicini, “Quantum tomography using state-preparation unitaries.,” in SODA, 2023.
[Bibtex]@inproceedings{sodaApeldoornCGN23, author = {Joran van Apeldoorn and Arjan Cornelissen and András Gilyén and Giacomo Nannicini}, title = {Quantum tomography using state-preparation unitaries.}, booktitle = {SODA}, year = 2023, keywords = {ELTE and international} } - F. Bencs, P. Csikvári, P. S. 0001, and J. Vondrák, “On complex roots of the independence polynomial.,” in SODA, 2023.
[Bibtex]@inproceedings{sodaBencsC0V23, author = {Ferenc Bencs and Péter Csikvári and Piyush Srivastava 0001 and Jan Vondrák}, title = {On complex roots of the independence polynomial.}, booktitle = {SODA}, year = 2023, keywords = {ELTE and international} } - G. Ivanyos and Y. Qiao, “On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions.,” in SODA, 2023.
[Bibtex]@inproceedings{sodaIvanyosQ23, author = {Gábor Ivanyos and Youming Qiao}, title = {On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions.}, booktitle = {SODA}, year = 2023, keywords = {SZTAKI and mostly_hungarian} } - G. Berend, “Masked Latent Semantic Modeling: an Efficient Pre-training Alternative to Masked Language Modeling.,” in ACL, 2023.
[Bibtex]@inproceedings{aclBerend23, author = {Gábor Berend}, title = {Masked Latent Semantic Modeling: an Efficient Pre-training Alternative to Masked Language Modeling.}, booktitle = {ACL}, year = 2023, keywords = {SZTE and all_hungarian} }
2022
- B. Vass, E. R. Bérczi-Kovács, Á. Barabás, Z. L. Hajdú, and J. Tapolcai, “Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem.,” in INFOCOM, 2022.
[Bibtex]@inproceedings{infocomVassBBHT22, author = {Balázs Vass and Erika R. Bérczi-Kovács and Ábel Barabás and Zsombor L. Hajdú and János Tapolcai}, title = {Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem.}, booktitle = {INFOCOM}, year = 2022, keywords = {BME and ELTE and mostly_hungarian} } - S. Miano, A. Sanaee, F. Risso, G. Rétvári, and G. Antichi, “Domain specific run time optimization for software data planes.,” in ASPLOS, 2022.
[Bibtex]@inproceedings{asplosMianoSRRA22, author = {Sebastiano Miano and Alireza Sanaee and Fulvio Risso and Gábor Rétvári and Gianni Antichi}, title = {Domain specific run time optimization for software data planes.}, booktitle = {ASPLOS}, year = 2022, keywords = {BME and international} }
2021
- J. Tapolcai, Z. L. Hajdú, A. Pasic, P. Ho, and L. Rónyai, “On Network Topology Augmentation for Global Connectivity under Regional Failures.,” in INFOCOM, 2021.
[Bibtex]@inproceedings{infocomTapolcaiHPHR21, author = {János Tapolcai and Zsombor L. Hajdú and Alija Pasic and Pin-Han Ho and Lajos Rónyai}, title = {On Network Topology Augmentation for Global Connectivity under Regional Failures.}, booktitle = {INFOCOM}, year = 2021, keywords = {BME and international} } - I. G. Gal, D. Barath, and L. Hajder, “Pose Estimation for Vehicle-mounted Cameras via Horizontal and Vertical Planes.,” in ICRA, 2021.
[Bibtex]@inproceedings{icraGalBH21, author = {Istan Gergo Gal and Daniel Barath and Levente Hajder}, title = {Pose Estimation for Vehicle-mounted Cameras via Horizontal and Vertical Planes.}, booktitle = {ICRA}, year = 2021, keywords = {ELTE and international} } - A. Gilyén, M. B. Hastings, and U. V. Vazirani, “(Sub)Exponential advantage of adiabatic Quantum computation with no sign problem.,” in STOC, 2021.
[Bibtex]@inproceedings{stocGilyenHV21, author = {András Gilyén and Matthew B. Hastings and Umesh V. Vazirani}, title = {(Sub)Exponential advantage of adiabatic Quantum computation with no sign problem.}, booktitle = {STOC}, year = 2021, keywords = {ELTE and international} } - M. Bentert, R. Bredereck, P. Györgyi, A. K. 0001, and R. Niedermeier, “A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem.,” in AAAI, 2021.
[Bibtex]@inproceedings{aaaiBentertBG0N21, author = {Matthias Bentert and Robert Bredereck and Péter Györgyi and Andrzej Kaczmarczyk 0001 and Rolf Niedermeier}, title = {A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem.}, booktitle = {AAAI}, year = 2021, keywords = {SZTAKI and international} } - D. M. Kelen and A. A. Benczúr, “A probabilistic perspective on nearest neighbor for implicit recommendation.,” in ICDM, 2021.
[Bibtex]@inproceedings{incdmKelenB21, author = {Domokos M. Kelen and András A. Benczúr}, title = {A probabilistic perspective on nearest neighbor for implicit recommendation.}, booktitle = {ICDM}, year = 2021, keywords = {SZTAKI and mostly_hungarian} } - T. Ficsor and G. Berend, “Changing the Basis of Contextual Representations with Explicit Semantics.,” in ACL, 2021.
[Bibtex]@inproceedings{aclFicsorB21, author = {Tamás Ficsor and Gábor Berend}, title = {Changing the Basis of Contextual Representations with Explicit Semantics.}, booktitle = {ACL}, year = 2021, keywords = {SZTE and mostly_hungarian} } - F. Wen, E. Aghajani, C. N. 0001, M. Lanza, and G. Bavota, “Siri, Write the Next Method.,” in ICSE, 2021.
[Bibtex]@inproceedings{icseWenA0LB21, author = {Fengcai Wen and Emad Aghajani and Csaba Nagy 0001 and Michele Lanza and Gabriele Bavota}, title = {Siri, Write the Next Method.}, booktitle = {ICSE}, year = 2021, keywords = {SZTE and international} }
2020
- L. T. 0001, B. Nagy, T. Gyimóthy, and L. Vidács, “Mining Hypernyms Semantic Relations from Stack Overflow.,” in ICSE, 2020.
[Bibtex]@inproceedings{icse0001NGV20, author = {László Tóth 0001 and Balázs Nagy and Tibor Gyimóthy and László Vidács}, title = {Mining Hypernyms Semantic Relations from Stack Overflow.}, booktitle = {ICSE}, year = 2020, keywords = {SZTE and BME and all_hungarian} } - L. Hajder and D. Barath, “Least-squares Optimal Relative Planar Motion for Vehicle-mounted Cameras.,” in ICRA, 2020.
[Bibtex]@inproceedings{icraHajderB20, author = {Levente Hajder and Daniel Barath}, title = {Least-squares Optimal Relative Planar Motion for Vehicle-mounted Cameras.}, booktitle = {ICRA}, year = 2020, keywords = {ELTE and mostly_hungarian} } - L. Hajder and D. Barath, “Relative planar motion for vehicle-mounted cameras from a single affine correspondence.,” in ICRA, 2020.
[Bibtex]@inproceedings{icraHajderB20a, author = {Levente Hajder and Daniel Barath}, title = {Relative planar motion for vehicle-mounted cameras from a single affine correspondence.}, booktitle = {ICRA}, year = 2020, keywords = {ELTE and mostly_hungarian} } - T. Tóth, Z. Pusztai, and L. Hajder, “Automatic LiDAR-Camera Calibration of Extrinsic Parameters Using a Spherical Target.,” in ICRA, 2020.
[Bibtex]@inproceedings{icraTothPH20, author = {Tekla Tóth and Zoltán Pusztai and Levente Hajder}, title = {Automatic LiDAR-Camera Calibration of Extrinsic Parameters Using a Spherical Target.}, booktitle = {ICRA}, year = 2020, keywords = {SZTAKI and ELTE and mostly_hungarian} } - V. Balogh, G. Berend, D. I. Diochnos, and G. Turán, “Understanding the Semantic Content of Sparse Word Embeddings Using a Commonsense Knowledge Base.,” in AAAI, 2020.
[Bibtex]@inproceedings{aaaiBaloghBDT20, author = {Vanda Balogh and Gábor Berend and Dimitrios I. Diochnos and György Turán}, title = {Understanding the Semantic Content of Sparse Word Embeddings Using a Commonsense Knowledge Base.}, booktitle = {AAAI}, year = 2020, keywords = {SZTE and Hungary and mostly_hungarian} } - U. Upadhyay, R. Busa-Fekete, W. Kotlowski, D. Pál, and B. Szörényi, “Learning to Crawl.,” in AAAI, 2020.
[Bibtex]@inproceedings{aaaiUpadhyayBKPS20, author = {Utkarsh Upadhyay and Róbert Busa-Fekete and Wojciech Kotlowski and Dávid Pál and Balázs Szörényi}, title = {Learning to Crawl.}, booktitle = {AAAI}, year = 2020, keywords = {SZTE and international} } - G. Dalal, B. Szörényi, and G. Thoppe, “A Tale of Two-Timescale Reinforcement Learning with the Tightest Finite-Time Bound.,” in AAAI, 2020.
[Bibtex]@inproceedings{aaaiDalalST20, author = {Gal Dalal and Balázs Szörényi and Gugan Thoppe}, title = {A Tale of Two-Timescale Reinforcement Learning with the Tightest Finite-Time Bound.}, booktitle = {AAAI}, year = 2020, keywords = {SZTE and international} } - G. Berend, “Sparsity Makes Sense: Word Sense Disambiguation Using Sparse Contextualized Word Representations.,” in EMNLP, 2020.
[Bibtex]@inproceedings{emnlpBerend20, author = {Gábor Berend}, title = {Sparsity Makes Sense: Word Sense Disambiguation Using Sparse Contextualized Word Representations.}, booktitle = {EMNLP}, year = 2020, keywords = {SZTE and all_hungarian} } - E. Aghajani, C. N. 0001, M. Linares-Vásquez, L. Moreno, G. Bavota, M. Lanza, and D. C. Shepherd, “Software documentation: the practitioners’ perspective.,” in ICSE, 2020.
[Bibtex]@inproceedings{icseAghajani0LMBLS20, author = {Emad Aghajani and Csaba Nagy 0001 and Mario Linares-Vásquez and Laura Moreno and Gabriele Bavota and Michele Lanza and David C. Shepherd}, title = {Software documentation: the practitioners' perspective.}, booktitle = {ICSE}, year = 2020, keywords = {SZTE and international} }
2019
- J. Pach, N. Rubin, and G. Tardos, “Planar point sets determine many pairwise crossing segments.,” in STOC, 2019.
[Bibtex]@inproceedings{stocPachRT19, author = {János Pach and Natan Rubin and Gábor Tardos}, title = {Planar point sets determine many pairwise crossing segments.}, booktitle = {STOC}, year = 2019, keywords = {Rényi and international} } - A. Beygelzimer, D. Pál, B. Szörényi, D. Thiruvenkatachari, C. Wei, and C. Zhang, “Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case.,” in ICML, 2019.
[Bibtex]@inproceedings{icmlBeygelzimerPSTW19, author = {Alina Beygelzimer and Dávid Pál and Balázs Szörényi and Devanathan Thiruvenkatachari and Chen-Yu Wei and Chicheng Zhang}, title = {Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case.}, booktitle = {ICML}, year = 2019, keywords = {SZTE and international} } - A. Golovnev, D. Pál, and B. Szörényi, “The information-theoretic value of unlabeled data in semi-supervised learning.,” in ICML, 2019.
[Bibtex]@inproceedings{icmlGolovnevPS19, author = {Alexander Golovnev and Dávid Pál and Balázs Szörényi}, title = {The information-theoretic value of unlabeled data in semi-supervised learning.}, booktitle = {ICML}, year = 2019, keywords = {SZTE and international} } - E. Aghajani, C. N. 0001, O. L. Vega-Márquez, M. Linares-Vásquez, L. Moreno, G. Bavota, and M. Lanza, “Software documentation issues unveiled.,” in ICSE, 2019.
[Bibtex]@inproceedings{icseAghajaniNVLMBL19, author = {Emad Aghajani and Csaba Nagy 0001 and Olga Lucero Vega-Márquez and Mario Linares-Vásquez and Laura Moreno and Gabriele Bavota and Michele Lanza}, title = {Software documentation issues unveiled.}, booktitle = {ICSE}, year = 2019, keywords = {SZTE and international} }
2018
- J. Tapolcai, B. Vass, Z. Heszberger, J. Bíró, D. Hay, F. A. Kuipers, and L. Rónyai, “A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters.,” in INFOCOM, 2018.
[Bibtex]@inproceedings{infocomTapolcaiVHBHKR18, author = {János Tapolcai and Bálazs Vass and Zalán Heszberger and József Bíró and David Hay and Fernando A. Kuipers and Lajos Rónyai}, title = {A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters.}, booktitle = {INFOCOM}, year = 2018, keywords = {BME and mostly_hungarian} } - S. Z. Kiss, É. Hosszu, J. Tapolcai, L. Rónyai, and O. Rottenstreich, “Bloom Filter with a False Positive Free Zone.,” in INFOCOM, 2018.
[Bibtex]@inproceedings{infocomKissHTRR18, author = {Sándor Z. Kiss and Éva Hosszu and János Tapolcai and Lajos Rónyai and Ori Rottenstreich}, title = {Bloom Filter with a False Positive Free Zone.}, booktitle = {INFOCOM}, year = 2018, keywords = {BME and international} } - B. Sonkoly, M. Szabo, B. N. 0001, A. Majdán, G. Pongrácz, and L. Toka, “FERO: Fast and Efficient Resource Orchestrator for a Data Plane Built on Docker and DPDK.,” in INFOCOM, 2018.
[Bibtex]@inproceedings{infocomSonkolySNMPT18, author = {Balázs Sonkoly and Marton Szabo and Balázs Németh 0001 and András Majdán and Gergely Pongrácz and László Toka}, title = {FERO: Fast and Efficient Resource Orchestrator for a Data Plane Built on Docker and DPDK.}, booktitle = {INFOCOM}, year = 2018, keywords = {BME and Ericsson and mostly_hungarian} } - D. Marx, M. Pilipczuk, and M. Pilipczuk, “On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs.,” in FOCS, 2018.
[Bibtex]@inproceedings{focsMarxPP18, author = {Dániel Marx and Marcin Pilipczuk and Michal Pilipczuk}, title = {On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs.}, booktitle = {FOCS}, year = 2018, keywords = {SZTAKI and international} } - L. C. 0009 and D. Marx, “Covering a tree with rooted subtrees – parameterized and approximation algorithms.,” in SODA, 2018.
[Bibtex]@inproceedings{sodaChenM18, author = {Lin Chen 0009 and Dániel Marx}, title = {Covering a tree with rooted subtrees - parameterized and approximation algorithms.}, booktitle = {SODA}, year = 2018, keywords = {SZTAKI and mostly_hungarian} } - M. de Berg, H. L. Bodlaender, S. Kisfaludi-Bak, D. Marx, and T. C. van der Zanden, “A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs.,” in STOC, 2018.
[Bibtex]@inproceedings{stocBergBKMZ18, author = {Mark de Berg and Hans L. Bodlaender and Sándor Kisfaludi-Bak and Dániel Marx and Tom C. van der Zanden}, title = {A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs.}, booktitle = {STOC}, year = 2018, keywords = {SZTAKI and international} } - G. Ivanyos and Y. Qiao, “Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing.,” in SODA, 2018.
[Bibtex]@inproceedings{sodaIvanyosQ18, author = {Gábor Ivanyos and Youming Qiao}, title = {Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing.}, booktitle = {SODA}, year = 2018, keywords = {SZTAKI and mostly_hungarian} } - G. Dalal, B. Szörényi, G. Thoppe, and S. Mannor, “Finite Sample Analyses for TD(0) With Function Approximation.,” in AAAI, 2018.
[Bibtex]@inproceedings{aaaiDalalSTM18, author = {Gal Dalal and Balázs Szörényi and Gugan Thoppe and Shie Mannor}, title = {Finite Sample Analyses for TD(0) With Function Approximation.}, booktitle = {AAAI}, year = 2018, keywords = {SZTE and international} }
2017
- J. Tapolcai, L. Rónyai, B. Vass, and L. Gyimothi, “List of shared risk link groups representing regional failures with limited size.,” in INFOCOM, 2017.
[Bibtex]@inproceedings{infocomTapolcaiRVG17, author = {János Tapolcai and Lajos Rónyai and Bálazs Vass and Laszlo Gyimothi}, title = {List of shared risk link groups representing regional failures with limited size.}, booktitle = {INFOCOM}, year = 2017, keywords = {BME and mostly_hungarian} } - L. Toka, B. Lajtha, É. Hosszu, B. Formanek, D. Gehberger, and J. Tapolcai, “A resource-aware and time-critical IoT framework.,” in INFOCOM, 2017.
[Bibtex]@inproceedings{infocomTokaLHFGT17, author = {László Toka and Balázs Lajtha and Éva Hosszu and Bence Formanek and Daniel Gehberger and János Tapolcai}, title = {A resource-aware and time-critical IoT framework.}, booktitle = {INFOCOM}, year = 2017, keywords = {BME and Ericsson and mostly_hungarian} } - R. Curticapean, H. Dell, and D. Marx, “Homomorphisms are a good basis for counting small subgraphs.,” in STOC, 2017.
[Bibtex]@inproceedings{stocCurticapeanDM17, author = {Radu Curticapean and Holger Dell and Dániel Marx}, title = {Homomorphisms are a good basis for counting small subgraphs.}, booktitle = {STOC}, year = 2017, keywords = {SZTAKI and international} } - D. Barath, T. Toth, and L. Hajder, “A Minimal Solution for Two-View Focal-Length Estimation Using Two Affine Correspondences.,” in CVPR, 2017.
[Bibtex]@inproceedings{cvprBarathTH17, author = {Daniel Barath and Tekla Toth and Levente Hajder}, title = {A Minimal Solution for Two-View Focal-Length Estimation Using Two Affine Correspondences.}, booktitle = {CVPR}, year = 2017, keywords = {ELTE and international} } - G. Ács, L. Melis, C. Castelluccia, and E. D. Cristofaro, “Differentially Private Mixture of Generative Neural Networks.,” in ICDM, 2017.
[Bibtex]@inproceedings{icdmAcsMCC17, author = {Gergely Ács and Luca Melis and Claude Castelluccia and Emiliano De Cristofaro}, title = {Differentially Private Mixture of Generative Neural Networks.}, booktitle = {ICDM}, year = 2017, keywords = {BME and international} } - C. Keller, S. Smorodinsky, and G. Tardos, “On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers.,” in SODA, 2017.
[Bibtex]@inproceedings{sodaKellerST17, author = {Chaya Keller and Shakhar Smorodinsky and Gábor Tardos}, title = {On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers.}, booktitle = {SODA}, year = 2017, keywords = {Rényi and international} } - R. Busa-Fekete, B. Szörényi, P. Weng, and S. Mannor, “Multi-objective Bandits: Optimizing the Generalized Gini Index.,” in ICML, 2017.
[Bibtex]@inproceedings{icmlBusa-FeketeSWM17, author = {Róbert Busa-Fekete and Balázs Szörényi and Paul Weng and Shie Mannor}, title = {Multi-objective Bandits: Optimizing the Generalized Gini Index.}, booktitle = {ICML}, year = 2017, keywords = {SZTE and mostly_hungarian} }
2016
- L. Molnár, G. Pongrácz, G. Enyedi, Z. L. Kis, L. Csikor, F. Juhász, A. Korösi, and G. Rétvári, “Dataplane Specialization for High-performance OpenFlow Software Switching.,” in SIGCOMM, 2016.
[Bibtex]@inproceedings{sigcommMolnarPEKCJKR16, author = {László Molnár and Gergely Pongrácz and Gábor Enyedi and Zoltán Lajos Kis and Levente Csikor and Ferenc Juhász and Attila Korösi and Gábor Rétvári}, title = {Dataplane Specialization for High-performance OpenFlow Software Switching.}, booktitle = {SIGCOMM}, year = 2016, keywords = {Ericsson and Hungary and BME and mostly_hungarian} } - F. V. Fomin, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, and S. S. 0001, “Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering.,” in FOCS, 2016.
[Bibtex]@inproceedings{focsFominLMPPS16, author = {Fedor V. Fomin and Daniel Lokshtanov and Dániel Marx and Marcin Pilipczuk and Michal Pilipczuk and Saket Saurabh 0001}, title = {Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering.}, booktitle = {FOCS}, year = 2016, keywords = {SZTAKI and international} } - R. Curticapean and D. Marx, “Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus.,” in SODA, 2016.
[Bibtex]@inproceedings{sodaCurticapeanM16, author = {Radu Curticapean and Dániel Marx}, title = {Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus.}, booktitle = {SODA}, year = 2016, keywords = {SZTAKI and mostly_hungarian} } - M. Bateni, E. D. Demaine, M. Hajiaghayi, and D. Marx, “A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting.,” in STOC, 2016.
[Bibtex]@inproceedings{stocBateniDHM16, author = {MohammadHossein Bateni and Erik D. Demaine and MohammadTaghi Hajiaghayi and Dániel Marx}, title = {A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting.}, booktitle = {STOC}, year = 2016, keywords = {SZTAKI and international} } - J. Pach, N. Rubin, and G. Tardos, “Beyond the Richter-Thomassen Conjecture.,” in SODA, 2016.
[Bibtex]@inproceedings{sodaPachRT16, author = {János Pach and Natan Rubin and Gábor Tardos}, title = {Beyond the Richter-Thomassen Conjecture.}, booktitle = {SODA}, year = 2016, keywords = {Rényi and international} } - K. Jasinska, K. Dembczynski, R. Busa-Fekete, K. Pfannschmidt, T. Klerx, and E. Hüllermeier, “Extreme F-measure Maximization using Sparse Probability Estimates.,” in ICML, 2016.
[Bibtex]@inproceedings{icmlJasinskaDBPKH16, author = {Kalina Jasinska and Krzysztof Dembczynski and Róbert Busa-Fekete and Karlson Pfannschmidt and Timo Klerx and Eyke Hüllermeier}, title = {Extreme F-measure Maximization using Sparse Probability Estimates.}, booktitle = {ICML}, year = 2016, keywords = {SZTE and international} } - N. Korda, B. Szörényi, and S. Li, “Distributed Clustering of Linear Bandits in Peer to Peer Networks.,” in ICML, 2016.
[Bibtex]@inproceedings{icmlKordaSL16, author = {Nathan Korda and Balázs Szörényi and Shuai Li}, title = {Distributed Clustering of Linear Bandits in Peer to Peer Networks.}, booktitle = {ICML}, year = 2016, keywords = {SZTE and international} }
2015
- B. M. P. Jansen and D. Marx, “Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels.,” in SODA, 2015.
[Bibtex]@inproceedings{sodaJansenM15, author = {Bart M. P. Jansen and Dániel Marx}, title = {Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels.}, booktitle = {SODA}, year = 2015, keywords = {SZTAKI and mostly_hungarian} } - D. Marx and P. Wollan, “An exact characterization of tractable demand patterns for maximum disjoint path problems.,” in SODA, 2015.
[Bibtex]@inproceedings{sodaMarxW15, author = {Dániel Marx and Paul Wollan}, title = {An exact characterization of tractable demand patterns for maximum disjoint path problems.}, booktitle = {SODA}, year = 2015, keywords = {SZTAKI and mostly_hungarian} } - J. Pach, N. Rubin, and G. Tardos, “On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves.,” in SODA, 2015.
[Bibtex]@inproceedings{sodaPachRT15, author = {János Pach and Natan Rubin and Gábor Tardos}, title = {On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves.}, booktitle = {SODA}, year = 2015, keywords = {Rényi and international} } - B. Daróczy, D. Siklósi, R. Pálovics, and A. A. Benczúr, “Text Classification Kernels for Quality Prediction over the C3 Data Set.,” in WWW, 2015.
[Bibtex]@inproceedings{wwwDaroczySPB15, author = {Bálint Daróczy and Dávid Siklósi and Róbert Pálovics and András A. Benczúr}, title = {Text Classification Kernels for Quality Prediction over the C3 Data Set.}, booktitle = {WWW}, year = 2015, keywords = {SZTAKI and all_hungarian} } - G. Turán and J. Yaggie, “Characterizability in Belief Revision.,” in IJCAI, 2015.
[Bibtex]@inproceedings{ijcaiTuranY15, author = {György Turán and Jon Yaggie}, title = {Characterizability in Belief Revision.}, booktitle = {IJCAI}, year = 2015, keywords = {Hungary and mostly_hungarian} } - B. Szörényi, R. Busa-Fekete, P. Weng, and E. Hüllermeier, “Qualitative Multi-Armed Bandits: A Quantile-Based Approach.,” in ICML, 2015.
[Bibtex]@inproceedings{icmlSzorenyiBWH15, author = {Balázs Szörényi and Róbert Busa-Fekete and Paul Weng and Eyke Hüllermeier}, title = {Qualitative Multi-Armed Bandits: A Quantile-Based Approach.}, booktitle = {ICML}, year = 2015, keywords = {SZTE and mostly_hungarian} } - R. Busa-Fekete, B. Szörényi, K. Dembczynski, and E. Hüllermeier, “Online F-Measure Optimization.,” in NIPS, 2015.
[Bibtex]@inproceedings{nipsBusa-FeketeSDH15, author = {Róbert Busa-Fekete and Balázs Szörényi and Krzysztof Dembczynski and Eyke Hüllermeier}, title = {Online F-Measure Optimization.}, booktitle = {NIPS}, year = 2015, keywords = {SZTE and mostly_hungarian} } - B. Szörényi, R. Busa-Fekete, A. Paul, and E. Hüllermeier, “Online Rank Elicitation for Plackett-Luce: A Dueling Bandits Approach.,” in NIPS, 2015.
[Bibtex]@inproceedings{nipsSzorenyiBPH15, author = {Balázs Szörényi and Róbert Busa-Fekete and Adil Paul and Eyke Hüllermeier}, title = {Online Rank Elicitation for Plackett-Luce: A Dueling Bandits Approach.}, booktitle = {NIPS}, year = 2015, keywords = {SZTE and mostly_hungarian} } - E. Tasnádi and G. Berend, “Supervised Prediction of Social Network Links Using Implicit Sources of Information.,” in WWW, 2015.
[Bibtex]@inproceedings{wwwTasnadiB15, author = {Ervin Tasnádi and Gábor Berend}, title = {Supervised Prediction of Social Network Links Using Implicit Sources of Information.}, booktitle = {WWW}, year = 2015, keywords = {SZTE and mostly_hungarian} }
2014
- J. Tapolcai, L. Rónyai, É. Hosszu, P. Ho, and S. S. 0001, “Signaling free localization of node failures in all-optical networks.,” in INFOCOM, 2014.
[Bibtex]@inproceedings{infocomTapolcaiRHHS14, author = {János Tapolcai and Lajos Rónyai and Éva Hosszu and Pin-Han Ho and Suresh Subramaniam 0001}, title = {Signaling free localization of node failures in all-optical networks.}, booktitle = {INFOCOM}, year = 2014, keywords = {BME and international} } - R. Curticapean and D. Marx, “Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts.,” in FOCS, 2014.
[Bibtex]@inproceedings{focsCurticapeanM14, author = {Radu Curticapean and Dániel Marx}, title = {Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts.}, booktitle = {FOCS}, year = 2014, keywords = {SZTAKI and mostly_hungarian} } - Y. C. 0001 and D. Marx, “Interval Deletion is Fixed-Parameter Tractable.,” in SODA, 2014.
[Bibtex]@inproceedings{sodaCaoM14, author = {Yixin Cao 0001 and Dániel Marx}, title = {Interval Deletion is Fixed-Parameter Tractable.}, booktitle = {SODA}, year = 2014, keywords = {SZTAKI and mostly_hungarian} } - R. H. Chitnis, M. Hajiaghayi, and D. Marx, “Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).,” in SODA, 2014.
[Bibtex]@inproceedings{sodaChitnisHM14, author = {Rajesh Hemant Chitnis and MohammadTaghi Hajiaghayi and Dániel Marx}, title = {Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).}, booktitle = {SODA}, year = 2014, keywords = {SZTAKI and international} } - S. Guillemot and D. Marx, “Finding small patterns in permutations in linear time.,” in SODA, 2014.
[Bibtex]@inproceedings{sodaGuillemotM14, author = {Sylvain Guillemot and Dániel Marx}, title = {Finding small patterns in permutations in linear time.}, booktitle = {SODA}, year = 2014, keywords = {SZTAKI and mostly_hungarian} } - P. N. Klein and D. Marx, “A subexponential parameterized algorithm for Subset TSP on planar graphs.,” in SODA, 2014.
[Bibtex]@inproceedings{sodaKleinM14, author = {Philip N. Klein and Dániel Marx}, title = {A subexponential parameterized algorithm for Subset TSP on planar graphs.}, booktitle = {SODA}, year = 2014, keywords = {SZTAKI and mostly_hungarian} } - L. A. Jeni, A. Lörincz, Z. S. 0001, J. F. Cohn, and T. Kanade, “Spatio-temporal Event Classification Using Time-Series Kernel Based Structured Sparsity.,” in ECCV, 2014.
[Bibtex]@inproceedings{eccvJeniLSCK14, author = {László A. Jeni and András Lörincz and Zoltán Szabó 0001 and Jeffrey F. Cohn and Takeo Kanade}, title = {Spatio-temporal Event Classification Using Time-Series Kernel Based Structured Sparsity.}, booktitle = {ECCV}, year = 2014, keywords = {ELTE and international} } - G. Ács and C. Castelluccia, “A case study: privacy preserving release of spatio-temporal density in paris.,” in KDD, 2014.
[Bibtex]@inproceedings{kddAcsC14, author = {Gergely Ács and Claude Castelluccia}, title = {A case study: privacy preserving release of spatio-temporal density in paris.}, booktitle = {KDD}, year = 2014, keywords = {BME and mostly_hungarian} } - R. Busa-Fekete, B. Szörényi, and E. Hüllermeier, “PAC Rank Elicitation through Adaptive Sampling of Stochastic Pairwise Preferences.,” in AAAI, 2014.
[Bibtex]@inproceedings{aaaiBusa-FeketeSH14, author = {Róbert Busa-Fekete and Balázs Szörényi and Eyke Hüllermeier}, title = {PAC Rank Elicitation through Adaptive Sampling of Stochastic Pairwise Preferences.}, booktitle = {AAAI}, year = 2014, keywords = {SZTE and mostly_hungarian} } - R. Busa-Fekete, E. Hüllermeier, and B. Szörényi, “Preference-Based Rank Elicitation using Statistical Models: The Case of Mallows.,” in ICML, 2014.
[Bibtex]@inproceedings{icmlBusa-FeketeHS14, author = {Róbert Busa-Fekete and Eyke Hüllermeier and Balázs Szörényi}, title = {Preference-Based Rank Elicitation using Statistical Models: The Case of Mallows.}, booktitle = {ICML}, year = 2014, keywords = {SZTE and mostly_hungarian} } - B. Szörényi, G. Kedenburg, and R. Munos, “Optimistic Planning in Markov Decision Processes Using a Generative Model.,” in NIPS, 2014.
[Bibtex]@inproceedings{nipsSzorenyiKM14, author = {Balázs Szörényi and Gunnar Kedenburg and Rémi Munos}, title = {Optimistic Planning in Markov Decision Processes Using a Generative Model.}, booktitle = {NIPS}, year = 2014, keywords = {SZTE and international} } - W. Hedgecock, M. Maroti, Á. Lédeczi, P. Völgyesi, and R. A. Banalagay, “Accurate real-time relative localization using single-frequency GPS.,” in SenSys, 2014.
[Bibtex]@inproceedings{sensysHedgecockMLVB14, author = {Will Hedgecock and Miklos Maroti and Ákos Lédeczi and Péter Völgyesi and Rueben A. Banalagay}, title = {Accurate real-time relative localization using single-frequency GPS.}, booktitle = {SenSys}, year = 2014, keywords = {SZTE and international} }
2013
- J. Tapolcai and G. Rétvári, “Router virtualization for improving IP-level resilience.,” in INFOCOM, 2013.
[Bibtex]@inproceedings{infocomTapolcaiR13, author = {János Tapolcai and Gábor Rétvári}, title = {Router virtualization for improving IP-level resilience.}, booktitle = {INFOCOM}, year = 2013, keywords = {BME and all_hungarian} } - G. Rétvári, J. Tapolcai, A. Korösi, A. Majdán, and Z. Heszberger, “Compressing IP forwarding tables: towards entropy bounds and beyond.,” in SIGCOMM, 2013.
[Bibtex]@inproceedings{sigcommRetvariTKMH13, author = {Gábor Rétvári and János Tapolcai and Attila Korösi and András Majdán and Zalán Heszberger}, title = {Compressing IP forwarding tables: towards entropy bounds and beyond.}, booktitle = {SIGCOMM}, year = 2013, keywords = {BME and mostly_hungarian} } - M. Cygan, D. Marx, M. Pilipczuk, and M. Pilipczuk, “The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable.,” in FOCS, 2013.
[Bibtex]@inproceedings{focsCyganMPP13, author = {Marek Cygan and Dániel Marx and Marcin Pilipczuk and Michal Pilipczuk}, title = {The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable.}, booktitle = {FOCS}, year = 2013, keywords = {SZTAKI and international} } - A. Garzó, B. Daróczy, T. Kiss, D. Siklósi, and A. A. Benczúr, “Cross-lingual web spam classification.,” in WWW, 2013.
[Bibtex]@inproceedings{wwwGarzoDKSB13, author = {András Garzó and Bálint Daróczy and Tamás Kiss and Dávid Siklósi and András A. Benczúr}, title = {Cross-lingual web spam classification.}, booktitle = {WWW}, year = 2013, keywords = {Ericsson and SZTAKI and mostly_hungarian} } - M. Saglam and G. Tardos, “On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems.,” in FOCS, 2013.
[Bibtex]@inproceedings{focsSaglamT13, author = {Mert Saglam and Gábor Tardos}, title = {On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems.}, booktitle = {FOCS}, year = 2013, keywords = {Rényi and mostly_hungarian} } - B. Szörényi, R. Busa-Fekete, I. Hegedüs, R. Ormándi, M. Jelasity, and B. Kégl, “Gossip-based distributed stochastic bandit algorithms.,” in ICML, 2013.
[Bibtex]@inproceedings{icmlSzorenyiBHOJK13, author = {Balázs Szörényi and Róbert Busa-Fekete and István Hegedüs and Róbert Ormándi and Márk Jelasity and Balázs Kégl}, title = {Gossip-based distributed stochastic bandit algorithms.}, booktitle = {ICML}, year = 2013, keywords = {SZTE and mostly_hungarian} } - G. Szarvas, R. Busa-Fekete, and E. Hüllermeier, “Learning to Rank Lexical Substitutions.,” in EMNLP, 2013.
[Bibtex]@inproceedings{emnlpSzarvasBH13, author = {György Szarvas and Róbert Busa-Fekete and Eyke Hüllermeier}, title = {Learning to Rank Lexical Substitutions.}, booktitle = {EMNLP}, year = 2013, keywords = {SZTE and international} } - R. Busa-Fekete, B. Szörényi, W. Cheng, P. Weng, and E. Hüllermeier, “Top-k Selection based on Adaptive Sampling of Noisy Preferences.,” in ICML, 2013.
[Bibtex]@inproceedings{icmlBusa-FeketeSCWH13, author = {Róbert Busa-Fekete and Balázs Szörényi and Weiwei Cheng and Paul Weng and Eyke Hüllermeier}, title = {Top-k Selection based on Adaptive Sampling of Noisy Preferences.}, booktitle = {ICML}, year = 2013, keywords = {SZTE and international} }
2012
- R. H. Chitnis, M. Hajiaghayi, and D. Marx, “Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset.,” in SODA, 2012.
[Bibtex]@inproceedings{sodaChitnisHM12, author = {Rajesh Hemant Chitnis and MohammadTaghi Hajiaghayi and Dániel Marx}, title = {Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset.}, booktitle = {SODA}, year = 2012, keywords = {SZTAKI and international} } - H. Dell and D. Marx, “Kernelization of packing problems.,” in SODA, 2012.
[Bibtex]@inproceedings{sodaDellM12, author = {Holger Dell and Dániel Marx}, title = {Kernelization of packing problems.}, booktitle = {SODA}, year = 2012, keywords = {SZTAKI and mostly_hungarian} } - M. Grohe and D. Marx, “Structure theorem and isomorphism test for graphs with excluded topological subgraphs.,” in STOC, 2012.
[Bibtex]@inproceedings{stocGroheM12, author = {Martin Grohe and Dániel Marx}, title = {Structure theorem and isomorphism test for graphs with excluded topological subgraphs.}, booktitle = {STOC}, year = 2012, keywords = {SZTAKI and mostly_hungarian} } - R. C. 0012, G. Ács, and C. Castelluccia, “Differentially private sequential data publication via variable-length n-grams.,” in CCS, 2012.
[Bibtex]@inproceedings{ccsChenAC12, author = {Rui Chen 0012 and Gergely Ács and Claude Castelluccia}, title = {Differentially private sequential data publication via variable-length n-grams.}, booktitle = {CCS}, year = 2012, keywords = {BME and international} } - G. Ács, C. Castelluccia, and R. C. 0012, “Differentially Private Histogram Publishing through Lossy Compression.,” in ICDM, 2012.
[Bibtex]@inproceedings{icdmAcsCC12, author = {Gergely Ács and Claude Castelluccia and Rui Chen 0012}, title = {Differentially Private Histogram Publishing through Lossy Compression.}, booktitle = {ICDM}, year = 2012, keywords = {BME and international} }
2011
- G. Rétvári, J. Tapolcai, G. Enyedi, and A. Császár, “IP fast ReRoute: Loop Free Alternates revisited.,” in INFOCOM, 2011.
[Bibtex]@inproceedings{infocomRetvariTEC11, author = {Gábor Rétvári and János Tapolcai and Gábor Enyedi and András Császár}, title = {IP fast ReRoute: Loop Free Alternates revisited.}, booktitle = {INFOCOM}, year = 2011, keywords = {BME and Ericsson and all_hungarian} } - G. Rétvári, A. Gulyás, Z. Heszberger, M. Csernai, and J. Bíró, “Compact policy routing.,” in PODC, 2011.
[Bibtex]@inproceedings{podcRetvariGHCB11, author = {Gábor Rétvári and András Gulyás and Zalán Heszberger and Márton Csernai and József Bíró}, title = {Compact policy routing.}, booktitle = {PODC}, year = 2011, keywords = {BME and international} } - Z. S. 0001, B. Póczos, and A. Lörincz, “Online group-structured dictionary learning.,” in CVPR, 2011.
[Bibtex]@inproceedings{cvprSzaboPL11, author = {Zoltán Szabó 0001 and Barnabás Póczos and András Lörincz}, title = {Online group-structured dictionary learning.}, booktitle = {CVPR}, year = 2011, keywords = {ELTE and mostly_hungarian} } - A. D. 0001, R. K. 0001, and T. Sarlós, “Fast locality-sensitive hashing.,” in KDD, 2011.
[Bibtex]@inproceedings{kddDasguptaKS11, author = {Anirban Dasgupta 0001 and Ravi Kumar 0001 and Tamás Sarlós}, title = {Fast locality-sensitive hashing.}, booktitle = {KDD}, year = 2011, keywords = {SZTAKI and international} }
2010
- G. Neu, A. G. 0001, C. Szepesvári, and A. Antos, “Online Markov Decision Processes under Bandit Feedback.,” in NIPS, 2010.
[Bibtex]@inproceedings{nipsNeuGSA10, author = {Gergely Neu and András György 0001 and Csaba Szepesvári and András Antos}, title = {Online Markov Decision Processes under Bandit Feedback.}, booktitle = {NIPS}, year = 2010, keywords = {BME and mostly_hungarian} } - G. Rétvári and G. Németh, “Demand-Oblivious Routing: Distributed vs. Centralized Approaches.,” in INFOCOM, 2010.
[Bibtex]@inproceedings{infocomRetvariN10, author = {Gábor Rétvári and Gábor Németh}, title = {Demand-Oblivious Routing: Distributed vs. Centralized Approaches.}, booktitle = {INFOCOM}, year = 2010, keywords = {BME and all_hungarian} } - A. D. 0001, R. K. 0001, and T. Sarlós, “A sparse Johnson: Lindenstrauss transform.,” in STOC, 2010.
[Bibtex]@inproceedings{stocDasguptaKS10, author = {Anirban Dasgupta 0001 and Ravi Kumar 0001 and Tamás Sarlós}, title = {A sparse Johnson: Lindenstrauss transform.}, booktitle = {STOC}, year = 2010, keywords = {SZTAKI and international} } - R. Busa-Fekete and B. Kégl, “Fast boosting using adversarial bandits.,” in ICML, 2010.
[Bibtex]@inproceedings{icmlBusa-FeketeK10, author = {Róbert Busa-Fekete and Balázs Kégl}, title = {Fast boosting using adversarial bandits.}, booktitle = {ICML}, year = 2010, keywords = {SZTE and mostly_hungarian} } - P. F. Felzenszwalb, G. Pap, É. Tardos, and R. Zabih, “Globally optimal pixel labeling algorithms for tree metrics.,” in CVPR, 2010.
[Bibtex]@inproceedings{cvprFelzenszwalbPTZ10, author = {Pedro F. Felzenszwalb and Gyula Pap and Éva Tardos and Ramin Zabih}, title = {Globally optimal pixel labeling algorithms for tree metrics.}, booktitle = {CVPR}, year = 2010, keywords = {SZTE and international} }
2009
- J. Tapolcai, B. W. 0002, and P. Ho, “On Monitoring and Failure Localization in Mesh All-Optical Networks.,” in INFOCOM, 2009.
[Bibtex]@inproceedings{infocomTapolcaiWH09, author = {János Tapolcai and Bin Wu 0002 and Pin-Han Ho}, title = {On Monitoring and Failure Localization in Mesh All-Optical Networks.}, booktitle = {INFOCOM}, year = 2009, keywords = {BME and international} } - B. Kégl and R. Busa-Fekete, “Boosting products of base classifiers.,” in ICML, 2009.
[Bibtex]@inproceedings{icmlKeglB09, author = {Balázs Kégl and Róbert Busa-Fekete}, title = {Boosting products of base classifiers.}, booktitle = {ICML}, year = 2009, keywords = {SZTE and mostly_hungarian} }
2008
- L. Babai, N. Nikolov, and L. Pyber, “Product growth and mixing in finite groups.,” in SODA, 2008.
[Bibtex]@inproceedings{sodaBabaiNP08, author = {László Babai and Nikolay Nikolov and László Pyber}, title = {Product growth and mixing in finite groups.}, booktitle = {SODA}, year = 2008, keywords = {Rényi and international} } - M. Langlois, R. H. Sloan, B. Szörényi, and G. Turán, “Horn Complements: Towards Horn-to-Horn Belief Revision.,” in AAAI, 2008.
[Bibtex]@inproceedings{aaaiLangloisSST08, author = {Marina Langlois and Robert H. Sloan and Balázs Szörényi and György Turán}, title = {Horn Complements: Towards Horn-to-Horn Belief Revision.}, booktitle = {AAAI}, year = 2008, keywords = {SZTE and Hungary and mostly_hungarian} }
2007
- A. G. 0001, L. Kocsis, I. Szabó, and C. Szepesvári, “Continuous Time Associative Bandit Problems.,” in IJCAI, 2007.
[Bibtex]@inproceedings{ijcaiGyorgyKSS07, author = {András György 0001 and Levente Kocsis and Ivett Szabó and Csaba Szepesvári}, title = {Continuous Time Associative Bandit Problems.}, booktitle = {IJCAI}, year = 2007, keywords = {BME and SZTAKI and mostly_hungarian} } - G. Rétvári, J. Bíró, and T. Cinkler, “Fairness in Capacitated Networks: A Polyhedral Approach.,” in INFOCOM, 2007.
[Bibtex]@inproceedings{infocomRetvariBC07, author = {Gábor Rétvári and József Bíró and Tibor Cinkler}, title = {Fairness in Capacitated Networks: A Polyhedral Approach.}, booktitle = {INFOCOM}, year = 2007, keywords = {BME and mostly_hungarian} }
2006
- T. Sarlós, A. A. Benczúr, K. Csalogány, D. Fogaras, and B. Rácz, “To randomize or not to randomize: space optimal summaries for hyperlink analysis.,” in WWW, 2006.
[Bibtex]@inproceedings{wwwSarlosBCFR06, author = {Tamás Sarlós and András A. Benczúr and Károly Csalogány and Dániel Fogaras and Balázs Rácz}, title = {To randomize or not to randomize: space optimal summaries for hyperlink analysis.}, booktitle = {WWW}, year = 2006, keywords = {SZTAKI and BME and all_hungarian} } - C. Borgs, J. T. Chayes, L. L. 0001, V. T. Sós, B. Szegedy, and K. Vesztergombi, “Graph limits and parameter testing.,” in STOC, 2006.
[Bibtex]@inproceedings{stocBorgsCLSSV06, author = {Christian Borgs and Jennifer T. Chayes and László Lovász 0001 and Vera T. Sós and Balázs Szegedy and Katalin Vesztergombi}, title = {Graph limits and parameter testing.}, booktitle = {STOC}, year = 2006, keywords = {ELTE and Rényi and mostly_hungarian} } - L. L. 0001 and S. S. Vempala, “Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization.,” in FOCS, 2006.
[Bibtex]@inproceedings{focsLovaszV06, author = {László Lovász 0001 and Santosh S. Vempala}, title = {Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization.}, booktitle = {FOCS}, year = 2006, keywords = {ELTE and mostly_hungarian} } - S. Arora, L. L. 0001, I. Newman, Y. Rabani, Y. Rabinovich, and S. S. Vempala, “Local versus global properties of metric spaces.,” in SODA, 2006.
[Bibtex]@inproceedings{sodaAroraLNRRV06, author = {Sanjeev Arora and László Lovász 0001 and Ilan Newman and Yuval Rabani and Yuri Rabinovich and Santosh S. Vempala}, title = {Local versus global properties of metric spaces.}, booktitle = {SODA}, year = 2006, keywords = {ELTE and international} } - B. Kusy, Á. Lédeczi, M. Maroti, and L. G. L. T. Meertens, “Node density independent localization.,” in IPSN, 2006.
[Bibtex]@inproceedings{ipsnKusyLMM06, author = {Branislav Kusy and Ákos Lédeczi and Miklos Maroti and Lambert G. L. T. Meertens}, title = {Node density independent localization.}, booktitle = {IPSN}, year = 2006, keywords = {SZTE and international} }
2005
- K. Friedl, G. Ivanyos, and M. Santha, “Efficient testing of groups.,” in STOC, 2005.
[Bibtex]@inproceedings{stocFriedlIS05, author = {Katalin Friedl and Gábor Ivanyos and Miklos Santha}, title = {Efficient testing of groups.}, booktitle = {STOC}, year = 2005, keywords = {BME and SZTAKI and mostly_hungarian} } - G. Rétvári, J. Bíró, T. Cinkler, and T. Henk, “A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm.,” in INFOCOM, 2005.
[Bibtex]@inproceedings{infocomRetvariBCH05, author = {Gábor Rétvári and József Bíró and Tibor Cinkler and Tamás Henk}, title = {A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm.}, booktitle = {INFOCOM}, year = 2005, keywords = {BME and mostly_hungarian} } - D. Marx, “The Closest Substring problem with small distances.,” in FOCS, 2005.
[Bibtex]@inproceedings{focsMarx05, author = {Dániel Marx}, title = {The Closest Substring problem with small distances.}, booktitle = {FOCS}, year = 2005, keywords = {SZTAKI and all_hungarian} } - M. Maróti, P. Völgyesi, S. Dóra, B. Kusy, A. Nádas, Á. Lédeczi, G. Balogh, and K. Molnár, “Radio interferometric geolocation.,” in SenSys, 2005.
[Bibtex]@inproceedings{sensysMarotiVDKNLBM05, author = {Miklós Maróti and Péter Völgyesi and Sebestyen Dóra and Branislav Kusy and András Nádas and Ákos Lédeczi and György Balogh and Károly Molnár}, title = {Radio interferometric geolocation.}, booktitle = {SenSys}, year = 2005, keywords = {SZTE and BME and international} } - Á. Lédeczi, P. Völgyesi, M. Maroti, G. Simon, G. Balogh, A. Nádas, B. Kusy, and S. Dóra, “Multiple simultaneous acoustic source localization in urban terrain.,” in IPSN, 2005.
[Bibtex]@inproceedings{ipsnLedecziVMSBNKD05, author = {Ákos Lédeczi and Péter Völgyesi and Miklos Maroti and Gyula Simon and György Balogh and András Nádas and Branislav Kusy and Sebestyen Dóra}, title = {Multiple simultaneous acoustic source localization in urban terrain.}, booktitle = {IPSN}, year = 2005, keywords = {SZTE and BME and international} } - L. A. Végh and A. A. Benczúr, “Primal-dual approach for directed vertex connectivity augmentation and generalizations.,” in SODA, 2005.
[Bibtex]@inproceedings{sodaVeghB05, author = {László A. Végh and András A. Benczúr}, title = {Primal-dual approach for directed vertex connectivity augmentation and generalizations.}, booktitle = {SODA}, year = 2005, keywords = {SZTAKI and mostly_hungarian} }
2004
- G. Simon, M. Maróti, Á. Lédeczi, G. Balogh, B. Kusy, A. Nádas, G. Pap, J. Sallai, and K. Frampton, “Sensor network-based countersniper system.,” in SenSys, 2004.
[Bibtex]@inproceedings{sensysSimonMLBKNPSF04, author = {Gyula Simon and Miklós Maróti and Ákos Lédeczi and György Balogh and Branislav Kusy and András Nádas and Gábor Pap and János Sallai and Ken Frampton}, title = {Sensor network-based countersniper system.}, booktitle = {SenSys}, year = 2004, keywords = {SZTE and BME and international} } - M. Maróti, B. Kusy, G. Simon, and Á. Lédeczi, “The flooding time synchronization protocol.,” in SenSys, 2004.
[Bibtex]@inproceedings{sensysMarotiKSL04, author = {Miklós Maróti and Branislav Kusy and Gyula Simon and Ákos Lédeczi}, title = {The flooding time synchronization protocol.}, booktitle = {SenSys}, year = 2004, keywords = {SZTE and international} } - S. Kogekar, S. Neema, B. Eames, X. D. Koutsoukos, Á. Lédeczi, and M. Maroti, “Constraint-guided dynamic reconfiguration in sensor networks.,” in IPSN, 2004.
[Bibtex]@inproceedings{ipsnKogekarNEKLM04, author = {Sachin Kogekar and Sandeep Neema and Brandon Eames and Xenofon D. Koutsoukos and Ákos Lédeczi and Miklos Maroti}, title = {Constraint-guided dynamic reconfiguration in sensor networks.}, booktitle = {IPSN}, year = 2004, keywords = {SZTE and international} }
2003
- K. Friedl, G. Ivanyos, F. Magniez, M. Santha, and P. Sen, “Hidden translation and orbit coset in quantum computing.,” in STOC, 2003.
[Bibtex]@inproceedings{stocFriedlIMSS03, author = {Katalin Friedl and Gábor Ivanyos and Frédéric Magniez and Miklos Santha and Pranab Sen}, title = {Hidden translation and orbit coset in quantum computing.}, booktitle = {STOC}, year = 2003, keywords = {BME and SZTAKI and international} } - B. Aronov, J. Pach, M. Sharir, and G. Tardos, “Distinct distances in three and higher dimensions.,” in STOC, 2003.
[Bibtex]@inproceedings{stocAronovPST03, author = {Boris Aronov and János Pach and Micha Sharir and Gábor Tardos}, title = {Distinct distances in three and higher dimensions.}, booktitle = {STOC}, year = 2003, keywords = {Rényi and international} } - G. Tardos, “Optimal probabilistic fingerprint codes.,” in STOC, 2003.
[Bibtex]@inproceedings{stocTardo03, author = {Gábor Tardos}, title = {Optimal probabilistic fingerprint codes.}, booktitle = {STOC}, year = 2003, keywords = {Rényi and all_hungarian} }
2000
- T. Cinkler, D. Marx, C. P. Larsen, and D. Fogaras, “Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks.,” in INFOCOM, 2000.
[Bibtex]@inproceedings{infocomCinklerMLF00, author = {Tibor Cinkler and Dániel Marx and Claus Popp Larsen and Dániel Fogaras}, title = {Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks.}, booktitle = {INFOCOM}, year = 2000, keywords = {SZTAKI and BME and mostly_hungarian} } - R. Szabó, P. Barta, F. Németh, and J. Bíró, “Call Admission Control in Generalized Processor Sharing (GPS) Schedulers Using Non-Rate Proportional Weighting of Sessions.,” in INFOCOM, 2000.
[Bibtex]@inproceedings{infocomSzaboBNB00, author = {Róbert Szabó and Peter Barta and Felician Németh and József Bíró}, title = {Call Admission Control in Generalized Processor Sharing (GPS) Schedulers Using Non-Rate Proportional Weighting of Sessions.}, booktitle = {INFOCOM}, year = 2000, keywords = {BME and international} } - J. Pach and G. Tardos, “On the boundary complexity of the union of fat triangles.,” in FOCS, 2000.
[Bibtex]@inproceedings{focsPachT00, author = {János Pach and Gábor Tardos}, title = {On the boundary complexity of the union of fat triangles.}, booktitle = {FOCS}, year = 2000, keywords = {Rényi and mostly_hungarian} }
About This List
This list includes papers published at CORE A* conferences where at least one author has a Hungarian affiliation. The data comes from the DBLP database, and only includes papers that were:
- Officially published in the conference proceedings
- At least 6 pages long, or 4 pages for SODA, STOC, and FOCS
This page-length filtering helps exclude short papers, work-in-progress submissions, demos, extended abstracts, position papers, and posters, to ensure that only full accepted papers are listed.
Filtering Options
- By author: Only authors with at least 5 papers on the list are displayed
- By affiliation type:
all_hungarian– all authors are affiliated with Hungarian institutionsmostly_hungarian– at least half of the authors are Hungarian-affiliatedinternational– contains at least one Hungarian-affiliated author
- By institution: e.g. BME, ELTE, Rényi Institute, SZTE, etc.
How the List is Generated
The core of this list is a curated Hungarian researcher spreadsheet that records where each researcher is or was affiliated. If an affiliation includes a year, it is also processed to determine the relevant time interval.
A script uses this data to query DBLP and collect publication metadata. Only papers that meet the page and venue criteria are included in the final BibTeX list displayed here.
Want to Help?
If you’d like to help refine or expand the Hungarian researcher spreadsheet, you can suggest corrections or additions directly in the spreadsheet.
The spreadsheet is currently view-only, but you can leave comments. If you’d like editing access (e.g., for multiple changes), feel free to email me at janos.tapolcai [at] gmail.com.
If you know of a paper that should be on the list but is missing, please send me an email and I’ll investigate why it was missed during the data collection process.
