David García-Soriano

43 papers A* 7A 5B 1Journal 23Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Beyond Shortest Paths: Node Fairness in Route Recommendation. Proc. VLDB Endow. Antonio Ferrara, David García-Soriano, Francesco Bonchi
2022	—	`book`	Correlation Clustering Francesco Bonchi, David García-Soriano, Francesco Gullo
2022	A	`conf`	Dense and well-connected subgraph detection in dual networks. SDM Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
2021	J	`jnl`	Dense and well-connected subgraph detection in dual networks. CoRR Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
2021	J	`jnl`	Finding densest k-connected subgraphs. Discret. Appl. Math. Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
2021	A*	`conf`	Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints. KDD David García-Soriano, Francesco Bonchi
2021	J	`jnl`	Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints. CoRR David García-Soriano, Francesco Bonchi
2020	J	`jnl`	Fair-by-design matching. Data Min. Knowl. Discov. David García-Soriano, Francesco Bonchi
2020	J	`jnl`	Finding Densest k-Connected Subgraphs. CoRR Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
2020	A*	`conf`	Query-Efficient Correlation Clustering. WWW David García-Soriano, Konstantin Kutzkov, Francesco Bonchi, Charalampos E. Tsourakakis
2020	J	`jnl`	Query-Efficient Correlation Clustering. CoRR David García-Soriano, Konstantin Kutzkov, Francesco Bonchi, Charalampos E. Tsourakakis
2018	J	`jnl`	Fair-by-design algorithms: matching problems and beyond. CoRR David García-Soriano, Francesco Bonchi
2017	J	`jnl`	Graph summarization with quality guarantees. Data Min. Knowl. Discov. Matteo Riondato, David García-Soriano, Francesco Bonchi
2017	A*	`conf`	Secure Centrality Computation Over Multiple Networks. WWW Gilad Asharov, Francesco Bonchi, David García-Soriano, Tamir Tassa
2017	A	`conf`	To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem. CIKM Natali Ruchansky, Francesco Bonchi, David García-Soriano, Francesco Gullo, Nicolas Kourtellis
2017	J	`jnl`	To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem. CoRR Natali Ruchansky, Francesco Bonchi, David García-Soriano, Francesco Gullo, Nicolas Kourtellis
2016	—	`conf`	Spheres of Influence for More Effective Viral Marketing. SIGMOD Conference Yasir Mehmood, Francesco Bonchi, David García-Soriano
2016	—	`conf`	The MULTISENSOR Project - Development of Multimedia Content Integration Technologies for Journalism, Media Monitoring and International Exporting Decision Support. MMDA@ECAI Dimitris Liparas, Stefanos Vrochidis, Ioannis Kompatsiaris, Gerard Casamayor, Leo Wanner, Ioannis Arapakis, David García-Soriano, Reinhard Busch, Boris Vaisman, Boyan Simeonov, Vladimir Alexiev, Andrey Belous, Emmanuel Jamin, Nicolaus Heise, Tilman Wagner, Michael Jugov, Mirja Eckhoff, Teresa Forrellat, Martí Puigbó
2016	B	`conf`	Validation of matching. IJCNN Ya Le, Eric Bax, Nicola Barbieri, David García-Soriano, Jitesh Mehta, James Li
2015	J	`jnl`	Partial Key Grouping: Load-Balanced Partitioning of Distributed Streams. CoRR Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales, David García-Soriano, Nicolas Kourtellis, Marco Serafini
2015	—	`conf`	The Minimum Wiener Connector Problem. SIGMOD Conference Natali Ruchansky, Francesco Bonchi, David García-Soriano, Francesco Gullo, Nicolas Kourtellis
2015	J	`jnl`	The Minimum Wiener Connector. CoRR Natali Ruchansky, Francesco Bonchi, David García-Soriano, Francesco Gullo, Nicolas Kourtellis
2015	J	`jnl`	The Power of Both Choices: Practical Load Balancing for Distributed Stream Processing Engines. CoRR Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales, David García-Soriano, Nicolas Kourtellis, Marco Serafini
2015	A*	`conf`	The power of both choices: Practical load balancing for distributed stream processing engines. ICDE Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales, David García-Soriano, Nicolas Kourtellis, Marco Serafini
2014	A*	`conf`	Correlation clustering: from theory to practice. KDD Francesco Bonchi, David García-Soriano, Edo Liberty
2014	A*	`conf`	Graph Summarization with Quality Guarantees. ICDM Matteo Riondato, David García-Soriano, Francesco Bonchi
2014	A	`conf`	Triangle counting in streamed graphs via small vertex covers. SDM David García-Soriano, Konstantin Kutzkov
2014	J	`jnl`	Validation of Network Reconciliation. CoRR Ya Le, Eric Bax, Nicola Barbieri, David García-Soriano, Jitesh Mehta, James Li
2013	J	`jnl`	Local correlation clustering. CoRR Francesco Bonchi, David García-Soriano, Konstantin Kutzkov
2013	J	`jnl`	Nearly Tight Bounds for Testing Function Isomorphism. SIAM J. Comput. Noga Alon, Eric Blais, Sourav Chakraborty, David García-Soriano, Arie Matsliah
2013	J	`jnl`	The non-adaptive query complexity of testing k-parities. Chic. J. Theor. Comput. Sci. Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf
2012	A	`conf`	Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching. CCC Sourav Chakraborty, Eldar Fischer, David García-Soriano, Arie Matsliah
2012	J	`jnl`	Monotonicity testing and shortest-path routing on the cube. Comb. Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah
2012	J	`jnl`	The non-adaptive query complexity of testing k-parities CoRR Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf
2011	A	`conf`	Cycle Detection, Order Finding and Discrete Log with Jumps. ICS Sourav Chakraborty, David García-Soriano, Arie Matsliah
2011	—	`conf`	Efficient Sample Extractors for Juntas with Applications. ICALP (1) Sourav Chakraborty, David García-Soriano, Arie Matsliah
2011	A*	`conf`	Nearly Tight Bounds for Testing Function Isomorphism. SODA Sourav Chakraborty, David García-Soriano, Arie Matsliah
2010	J	`jnl`	Learning parities in the mistake-bound model. Inf. Process. Lett. Harry Buhrman, David García-Soriano, Arie Matsliah
2010	—	`conf`	Monotonicity Testing and Shortest-Path Routing on the Cube. APPROX-RANDOM Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah
2010	J	`jnl`	Monotonicity Testing and Shortest-Path Routing on the Cube. Electron. Colloquium Comput. Complex. David García-Soriano, Arie Matsliah, Sourav Chakraborty, Jop Briët
2010	J	`jnl`	Nearly Tight Bounds for Testing Function Isomorphism. Electron. Colloquium Comput. Complex. Sourav Chakraborty, David García-Soriano, Arie Matsliah
2009	—	`conf`	Learning Parities in the Mistake-Bound model. Algebraic Methods in Computational Complexity Harry Buhrman, David García-Soriano, Arie Matsliah
2009	J	`jnl`	Learning parities in the mistake-bound model. Electron. Colloquium Comput. Complex. Harry Buhrman, David García-Soriano, Arie Matsliah