Mannens, Isja

1. Tight bounds for counting colorings and connected edge sets\n parameterized by cutwidth
   2021/10/06 by Carla Groenland, Groenland, Carla, Jesper Nederlof +5 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Limits and Structures in Graph Theory #Markov Chains and Monte Carlo Methods
2. On the Parameterized Complexity of the Connected Flow and Many Visits\n TSP Problem
   2021/06/22 by Isja Mannens, Jesper Nederlof, Mannens, Isja +5 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Optimization and Search Problems
3. The Parameterised Complexity of Integer Multicommodity Flow
   2023/10/09 by Hans L. Bodlaender, Bodlaender, Hans L., Isja Mannens +7 · 2 citations
   Computer Science · Economics, Econometrics and Finance · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Global trade and economics
4. Reconstructing Graphs from Connected Triples
   2023/03/12 by Paul Bastide, Linda S. Cook, Bastide, Paul +11 · 1 citation
   Computer Science · #05 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #G.2.2 #Machine Learning and Algorithms