Four-Set Hypergraphlets for Characterization of Directed Hypergraphs

Συγγραφείς: Heechan Moon, Hyunju Kim, Sunwoo Kim 0006, Kijung Shin

Πηγή: IEEE Transactions on Knowledge and Data Engineering. 38:3640-3654

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2311.14289

FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs

Συγγραφείς: Matthias Lanzinger, Igor Razgon

Συνεισφορές: Matthias Lanzinger and Igor Razgon

Πηγή: ACM Transactions on Computation Theory. 18:1-34

Θεματικοί όροι: FOS: Computer and information sciences, hypergraphs, parameterized algorithms, generalized hypertree width, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), approximation algorithms

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2309.17049
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.48

Hardness of Learning Boolean Functions from Label Proportions

Συγγραφείς: Venkatesan Guruswami, Rishi Saket

Συνεισφορές: Venkatesan Guruswami and Rishi Saket

Πηγή: ACM Transactions on Computation Theory. 18:1-15

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Machine Learning, Hardness, Computational learning, Computer Science - Data Structures and Algorithms, Learning from label proportions, Data Structures and Algorithms (cs.DS), Boolean functions, Computational Complexity (cs.CC), Machine Learning (cs.LG)

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2403.19401
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2023.37

ConflictSync: Bandwidth Efficient Synchronization of Divergent State

Συγγραφείς: Carlos Baquero, Pedro Gomes, Miguel Boaventura Rodrigues

Πηγή: Proceedings of the 13th International Workshop on Principles and Practice of Consistency for Distributed Data. :32-39

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, H.0, D.4, Computer Science - Data Structures and Algorithms, E.4, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2505.01144

Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra

Συγγραφείς: Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto

Συνεισφορές: Takehiro Ito and Naonori Kakimura and Naoyuki Kamiyama and Yusuke Kobayashi and Shun-ichi Maezawa and Yuta Nozaki and Yoshio Okamoto

Πηγή: SIAM Journal on Discrete Mathematics. 40:554-575

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, polymatroids, Discrete Mathematics (cs.DM), combinatorial shortest path, Computer Science - Data Structures and Algorithms, NP-hardness, FOS: Mathematics, Mathematics - Combinatorics, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Graph associahedra, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2304.14782
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.82

Improved Approximation Algorithms for the Expanding Search Problem

Συγγραφείς: Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior

Συνεισφορές: Svenja M. Griesbach and Felix Hommelsheim and Max Klimm and Kevin Schewior, Li Gortz, Inge, Farach-Colton, Martin, Puglisi, Simon J., Herman, Grzegorz

Πηγή: Griesbach, S M, Hommelsheim, F, Klimm, M & Schewior, K 2026, 'Improved Approximation Algorithms for the Expanding Search Problem', SIAM Journal on Discrete Mathematics, vol. 40, no. 1, pp. 349-373. https://doi.org/10.1137/25M1759902
Griesbach, S M, Hommelsheim, F, Klimm, M & Schewior, K 2023, Improved Approximation Algorithms for the Expanding Search Problem. in I Li Gortz, M Farach-Colton, S J Puglisi & G Herman (eds), 31st Annual European Symposium on Algorithms, ESA 2023., 54, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, vol. 274, 31st Annual European Symposium on Algorithms, ESA 2023, Amsterdam, Netherlands, 04/09/2023. https://doi.org/10.4230/LIPIcs.ESA.2023.54

Θεματικοί όροι: FOS: Computer and information sciences, Search Problem, hardness of approximation, Euclidean graph, minimum latency problem, expanding search problem, traveling repairperson problem, Expanding Search, 0102 computer and information sciences, 68W25, 68R12, 01 natural sciences, Graph Exploration, Traveling Repairperson Problem, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), approximation algorithm, Approximation Algorithm

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2301.03638
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.54
https://portal.findresearcher.sdu.dk/da/publications/e66b48c1-e82d-4097-86af-e0715532eafd
https://doi.org/10.4230/LIPIcs.ESA.2023.54
https://portal.findresearcher.sdu.dk/da/publications/e66b48c1-e82d-4097-86af-e0715532eafd
https://findresearcher.sdu.dk/ws/files/243024319/LIPIcs_ESA_2023_54.pdf
https://doi.org/10.4230/LIPIcs.ESA.2023.54

Exact Algorithms for Distance to Unique Vertex Cover

Συγγραφείς: Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler, Manolis Vasilakis

Πηγή: Proceedings of the AAAI Conference on Artificial Intelligence. 40:14217-14224

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2502.05059

Best of Both Worlds Guarantees for Equitable Allocations

Συγγραφείς: Umang Bhaskar, Vishwa Prakash HV, Aditi Sethia, Rakshitha

Πηγή: Proceedings of the AAAI Conference on Artificial Intelligence. 40:16682-16690

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computer Science and Game Theory (cs.GT)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2505.05809

Quantum Algorithms for Spectral Sums

Συγγραφείς: Alessandro Luongo, Changpeng Shao

Πηγή: Proceedings of the AAAI Conference on Artificial Intelligence. 40:24178-24188

Θεματικοί όροι: FOS: Computer and information sciences, Quantum Physics, Computer Science - Machine Learning, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Computer Science - Data Structures and Algorithms, 0103 physical sciences, FOS: Physical sciences, Data Structures and Algorithms (cs.DS), Quantum Physics (quant-ph), 01 natural sciences, Machine Learning (cs.LG)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2011.06475
https://arxiv.org/abs/2011.06475

A Theoretical Model for Grit in Pursuing Ambitious Ends

Συγγραφείς: Avrim Blum, Emily Diana, Kavya Ravichandran, Alexander Williams Tolbert

Πηγή: Proceedings of the AAAI Conference on Artificial Intelligence. 40:38270-38277

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computers and Society, Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms, Computers and Society (cs.CY), Data Structures and Algorithms (cs.DS), Applications (stat.AP), Statistics - Applications, Computer Science and Game Theory (cs.GT)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2503.02952

A Knowledge Compilation Map for Quantum Information

Συγγραφείς: Lieuwe Vinkhuijzen, Tim Coopmans, Alfons Laarman

Πηγή: Proceedings of the AAAI Conference on Artificial Intelligence. 40:19406-19414

Θεματικοί όροι: FOS: Computer and information sciences, Quantum Physics, F.2, FOS: Physical sciences, 0102 computer and information sciences, 02 engineering and technology, E.1, 68P05, 01 natural sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Quantum Physics (quant-ph)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2401.01322

The Complexity of Homomorphism Reconstructibility

Συγγραφείς: Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke

Συνεισφορές: Jan Böker and Louis Härtel and Nina Runde and Tim Seppelt and Christoph Standke

Πηγή: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 19:1-19:20 (2024). doi:10.4230/LIPIcs.STACS.2024.19
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14
41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)

Θεματικοί όροι: FOS: Computer and information sciences, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), Theory of computation → Graph algorithms analysis, graph homomorphism, parameterised complexity, Computer Science - Data Structures and Algorithms, counting complexity, FOS: Mathematics, Mathematics - Combinatorics, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2310.09009
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.19
https://publications.rwth-aachen.de/record/981455

Globally minimal defensive alliances: A parameterized perspective

Συγγραφείς: Ajinkya Gaikwad, Soumen Maity

Πηγή: Discrete Applied Mathematics. 385:86-99

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2202.02010
https://arxiv.org/abs/2202.02010

Reducing Isotropy and Volume to KLS: Faster Rounding and Volume Algorithms

Συγγραφείς: He Jia, Aditi Laddha, Yin Tat Lee, Santosh Vempala

Πηγή: Journal of the ACM. 73:1-21

Θεματικοί όροι: Mathematics - Functional Analysis, FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 0101 mathematics, Computational Complexity (cs.CC), 01 natural sciences, Functional Analysis (math.FA)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2008.02146

Fixed-Sparsity Matrix Approximation from Matrix-Vector Products

Συγγραφείς: Noah Amsel, Tyler Chen, Feyza Duman Keles, Diana Halikias, Cameron Musco, Christopher Musco

Πηγή: SIAM Journal on Matrix Analysis and Applications. 47:483-511

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Mathematics - Numerical Analysis, Numerical Analysis (math.NA)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2402.09379

On the Non-Submodularity of the Problem of Adding Links to Minimize the Effective Graph Resistance

Συγγραφείς: Achterberg, M.A., Kooij, R.E.

Συνεισφορές: ISP - ICT, Strategy & Policy, CST – Cyber Security Technologies

Πηγή: Journal of Graph Algorithms and Applications, 30(1), pp. 109–132.

Θεματικοί όροι: Optimization, FOS: Computer and information sciences, Force method, Simple++, FOS: Physical sciences, Optimal systems, Brute force, Mathematical Physics (math-ph), NP-hard, Approximation algorithms, Greedy algorithms, Submodularity, Computer Science - Data Structures and Algorithms, Performance bounds, Data Structures and Algorithms (cs.DS), Graph algorithms, Optimal solutions, Submodular, Optimization problems, Mathematical Physics

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2501.03363
https://resolver.tno.nl/uuid:00000000-0000-0000-0000-0000a1029222
https://publications.tno.nl/publication/34645899/8Cs6BZUV/Achterberg-2026-Non-Submodularity.pdf

Largest Common Subgraph of Two Forests

Συγγραφείς: Dieter Rautenbach, Florian Werner

Πηγή: Journal of Graph Algorithms and Applications. 30:47-63

Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Computer Science - Discrete Mathematics

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2403.03696

Hutchinson’s Estimator is Bad at Kronecker-Trace-Estimation

Συγγραφείς: Raphael A. Meyer, Haim Avron

Πηγή: SIAM Journal on Matrix Analysis and Applications. 47:353-387

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, 65F99 (Primary) 15A69 (Secondary), Data Structures and Algorithms (cs.DS), Mathematics - Numerical Analysis, Numerical Analysis (math.NA), G.1.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2309.04952

Property Testing with Online Adversaries

Συγγραφείς: Omri Ben-Eliezer, Esty Kelman, Uri Meir, Sofya Raskhodnikova

Συνεισφορές: Omri Ben-Eliezer and Esty Kelman and Uri Meir and Sofya Raskhodnikova

Πηγή: ACM Transactions on Computation Theory

Θεματικοί όροι: FOS: Computer and information sciences, Reed-Muller codes, Discrete Mathematics (cs.DM), Computational Complexity (cs.CC), corruption-resilience, erasure-resilience, Computer Science - Computational Complexity, Linearity testing, low-degree testing, testing properties of sequences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2311.16566
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.11

Independent Set Reconfiguration on Directed Graphs

Συγγραφείς: Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa

Συνεισφορές: Takehiro Ito and Yuni Iwamasa and Yasuaki Kobayashi and Yu Nakahata and Yota Otachi and Masahiro Takahashi and Kunihiro Wasa

Πηγή: SIAM Journal on Discrete Mathematics. 40:82-101

Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0102 computer and information sciences, 02 engineering and technology, directed graph, Combinatorial reconfiguration, 01 natural sciences, token sliding, independent set, graph algorithm, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2203.13435
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.58