Telle, Jan Arne
- Between Treewidth and Clique-width
2014/04/30 by Sæther, Sigve Hortemo, Telle, Jan Arne · 2 citations
#Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width
2019/10/02 by Bergougnoux, Benjamin, Papadopoulos, Charis, Telle, Jan Arne · 3 citations
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- Linear MIM-Width of Trees
2019/07/09 by Høgemo, Svein, Telle, Jan Arne, Vågset, Erlend Raa · 2 citations
#Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- Recognition of Linear and Star Variants of Leaf Powers is in P
2021/05/26 by Benjamin Bergougnoux, Svein Høgemo, Bergougnoux, Benjamin +5 · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithms and Data Compression #Combinatorics (math.CO) #Commutative Algebra and Its Applications #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
- Connecting Terminals and 2-Disjoint Connected Subgraphs
2013/01/11 by Jan Arne Telle, Telle, Jan Arne, Yngve Villanger +1 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Limits and Structures in Graph Theory
- The graph formulation of the union-closed sets conjecture
2012/12/17 by Henning Bruhn, Pierre Charbit, Bruhn, Henning +5 · 1 citation
Computer Science · #05C69 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #FOS: Mathematics
- Solving MaxSAT and #SAT on structured CNF formulas
2014/02/26 by Sigve Hortemo Sæther, Sæther, Sigve Hortemo, Jan Arne Telle +3 · 1 citation
Computer Science · #Advanced Graph Theory Research #Artificial Intelligence (cs.AI) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
- Maximum matching width: new characterizations and a fast algorithm for dominating set
2015/07/09 by Jeong, Jisu, Sæther, Sigve Hortemo, Telle, Jan Arne · 1 citation
#05C85 #68R10 #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- Typical Sequences Revisited --- Computing Width Parameters of Graphs
2019/05/09 by Bodlaender, Hans L., Jaffke, Lars, Telle, Jan Arne · 1 citation
#Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
- Classes of intersection digraphs with good algorithmic properties
2021/05/04 by Jaffke, Lars, Kwon, O-joung, Telle, Jan Arne · 1 citation
#Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2