Items where authors include "Xue, J."

Proceedings Paper

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (2 more authors) (2025) Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. In: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. The 57th ACM Symposium on Theory of Computing (STOC 2025), 23-27 Jun 2025, Prague, Czech Republic. ACM , New York, NY, United States , pp. 1965-1974. ISBN 979-8-4007-1510-5

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (2 more authors) (2025) Subexponential Parameterized Algorithms for Hitting Subgraphs. In: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. The 57th ACM Symposium on Theory of Computing (STOC 2025), 23-27 Jun 2025, Prague, Czech Republic. ACM , New York, NY, United States , pp. 1975-1984. ISBN 979-8-4007-1510-5

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (3 more authors) (2025) Crossing Number in Slightly Superexponential Time (Extended Abstract). In: Azar, Y. and Panigrahi, D., (eds.) Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM-SIAM Symposium on Discrete Algorithms (SODA25), 12-15 Jan 2025, New Orleans, Louisiana, U.S.A.. SIAM , pp. 1412-1424. ISBN 978-1-61197-832-2

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (2 more authors) (2024) Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. In: In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). APPROX/RANDOM 2024, 28-30 Aug 2024, London. Leibniz International Proceedings in Informatics (LIPIcs), 317 . LIPIcs , Wadern, Germany , 6:1-6:14. ISBN 978-3-95977-348-5