Vangelis Th. Paschos
- Structurally Parameterized d-Scattered Set
2017/09/07 by Ioannis Katsikarelis, Michael Lampis, Katsikarelis, Ioannis +3 · 6 citations
Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #cs.CC
- Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse
2015/07/15 by Dimitris Fotakis, Michael Lampis, Fotakis, Dimitris +4 · 3 citations
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Computational Complexity (cs.CC) #FOS: Computer and information sciences #cs.CC
- Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center
2017/04/28 by Ioannis Katsikarelis, Michael Lampis, Katsikarelis, Ioannis +3 · 4 citations
Computer Science · #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.CC #cs.DS
- A Bottom-Up Method and Fast Algorithms for max independent set
2010/01/01 by Nicolas Bourgeois, Bruno Escoffier, Vangélis Th. Paschos +2 · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Approximation algorithm #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Degree (music) #Discrete mathematics #Graph #Independent set #Line graph #Mathematics #Maximal independent set #Optimization and Search Problems #Pathwidth #Set (abstract data type) #Time complexity
- Time-Approximation Trade-offs for Inapproximable Problems
2015/02/20 by Édouard Bonnet, Michael Lampis, Bonnet, Édouard +3 · 1 citation
Computer Science · #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.CC #cs.DS
- Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation
2021/01/19 by Louis Dublois, Michael Lampis, Dublois, Louis +4 · 1 citation
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.CC #cs.DS
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
2005/04/07 by Cristina Bazgan, Bruno Escoffier, Vangélis Th. Paschos +1 · 2 citations
Computer Science · Mathematics · #APX #Advanced Algebra and Logic #Combinatorics #Completeness (order theory) #Complexity and Algorithms in Graphs #Discrete mathematics #Geometry #Mathematical analysis #Mathematics #Physics #Reduction (mathematics) #semigroups and automata theory
- Completeness in approximation classes beyond APX
2006/06/15 by Bruno Escoffier, Vangélis Th. Paschos, Vangelis Th. Paschos · 1 citation
Computer Science · Mathematics · #APX #Advanced Graph Theory Research #Approximation algorithm #Artificial intelligence #Class (philosophy) #Combinatorics #Completeness (order theory) #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Graph #Logarithm #Machine Learning and Algorithms #Mathematical analysis #Mathematics #Reduction (mathematics)
- Sparsification and subexponential approximation
2016/10/12 by Édouard Bonnet, Vangélis Th. Paschos, Vangelis Th. Paschos · 1 citation
Computer Science · Mathematics · #Algorithm #Approximation algorithm #Combinatorics #Complexity and Algorithms in Graphs #Computation #Computer science #Cover (algebra) #Discrete mathematics #Dominating set #Error Correcting Code Techniques #Exponential function #Feedback vertex set #Graph #Independent set #Mathematics #Optimization and Search Problems #Order (exchange) #Set (abstract data type) #Set cover problem #Vertex (graph theory) #Vertex cover