3 citations · 5 across the 7 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.LG2026
Path Laplacian Encodings for Directed Graphs
Lydia Mezrag, Semih Cantürk, Michael Perlmutter +2
Directed graphs naturally model many real-world systems in which interactions are asymmetric, such as citation networks, web graphs, and information-flow networks. However, graph l…
cs.LG2026
Can Computational Reducibility Lead to Transferable Models for Graph Combinatorial Optimization?
Semih Cantürk, Thomas Sabourin, Frederik Wenkel +2
A key challenge in developing unified neural solvers for combinatorial optimization (CO) is the efficient generalization of models from a given set of tasks to new tasks unseen dur…