The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Vangelis Th. Paschos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marc Demange, Vangelis Th. Paschos
    Constructive - Non-constructive Approximation and Maximum Independent Set Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:194-207 [Conf]
  2. Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos
    Algorithms for the On-Line Quota Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:290-299 [Conf]
  3. Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
    Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:275-286 [Conf]
  4. Vangelis Th. Paschos
    A Theorem on the Approximation of Set Cover and Vertex Cover. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:278-287 [Conf]
  5. Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos
    Probabilistic Coloring of Bipartite and Split Graphs. [Citation Graph (0, 0)][DBLP]
    ICCSA (4), 2005, pp:202-211 [Conf]
  6. Bruno Escoffier, Vangelis Th. Paschos
    Differential Approximation of min sat, max sat and Related Problems. [Citation Graph (0, 0)][DBLP]
    ICCSA (4), 2005, pp:192-201 [Conf]
  7. Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
    Weighted Coloring: Further Complexity and Approximability Results. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:205-214 [Conf]
  8. A. Benkouar, Yannis Manoussakis, Vangelis Th. Paschos, Rachid Saad
    On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:190-198 [Conf]
  9. Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos
    Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:124-136 [Conf]
  10. Federico Della Croce, Vangelis Th. Paschos
    Computing Optimal Solutions for the min 3-set covering Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:685-692 [Conf]
  11. Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier
    Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:896-907 [Conf]
  12. Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad
    Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:130-138 [Conf]
  13. Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos
    Completeness in Differential Approximation Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:179-188 [Conf]
  14. Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, A. N. Staylopatis
    On the Mean Execution Time of Recursive Definitions on Relational Databases. [Citation Graph (0, 3)][DBLP]
    MFDBS, 1991, pp:119-133 [Conf]
  15. Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière
    Greedy Differential Approximations for Min Set Cover. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:62-71 [Conf]
  16. Marc Demange, Xavier Paradon, Vangelis Th. Paschos
    On-Line Maximum-Order Induces Hereditary Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2000, pp:327-335 [Conf]
  17. Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
    Reoptimization of Minimum and Maximum Traveling Salesman's Tours. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:196-207 [Conf]
  18. Marc Demange, Vangelis Th. Paschos
    Algorithms and Models for the On-Line Vertex-Covering. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:102-113 [Conf]
  19. Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos
    Weighted Node Coloring: When Stable Sets Are Expensive. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:114-125 [Conf]
  20. Cécile Murat, Vangelis Th. Paschos
    The Probabilistic Minimum Coloring Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:346-357 [Conf]
  21. Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
    The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:377-388 [Conf]
  22. Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Andreas Stafylopatis
    Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:3, pp:211-243 [Journal]
  23. Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
    Differential approximation results for the Steiner tree problem. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2003, v:16, n:5, pp:733-739 [Journal]
  24. Vangelis Th. Paschos
    Polynomial Approximation and Graph-Coloring. [Citation Graph (0, 0)][DBLP]
    Computing, 2003, v:70, n:1, pp:41-86 [Journal]
  25. Vangelis Th. Paschos
    A Survey of Approximately Optimal Solutions to Some Covering and Packing Problems. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1997, v:29, n:2, pp:171-209 [Journal]
  26. Cécile Murat, Vangelis Th. Paschos
    On the probabilistic minimum coloring and minimum k-coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:3, pp:564-586 [Journal]
  27. Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
    A hypocoloring model for batch scheduling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:146, n:1, pp:3-26 [Journal]
  28. Tinaz Ekim, Vangelis Th. Paschos
    Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2004, v:81, n:5, pp:569-582 [Journal]
  29. Bruno Escoffier, Vangelis Th. Paschos
    Proving completeness by logic. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2005, v:82, n:2, pp:151-161 [Journal]
  30. Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos
    Completeness in differential approximation classes. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1267-1295 [Journal]
  31. Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos
    Algorithms for the On-Line Quota Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:2, pp:89-94 [Journal]
  32. Marc Demange, Pascal Grisoni, Vangelis Th. Paschos
    Approximation Results for the Minimum Graph Coloring Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:1, pp:19-23 [Journal]
  33. Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
    Weighted Coloring: further complexity and approximability results. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:3, pp:98-103 [Journal]
  34. Vangelis Th. Paschos
    A (Delta/2)-Approximation Algorithm for the Maximum Independent Set Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:1, pp:11-13 [Journal]
  35. Marc Demange, Vangelis Th. Paschos
    Improved Approximations for Weighted and Unweighted Graph Problems. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:6, pp:763-787 [Journal]
  36. Cécile Murat, Vangelis Th. Paschos
    The probabilistic longest path problem. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:3, pp:207-219 [Journal]
  37. Federico Della Croce, Vangelis Th. Paschos, Alexis Tsoukiàs
    An improved general procedure for lexicographic bottleneck problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:4, pp:187-194 [Journal]
  38. Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
    Local approximations for maximum partial subgraph problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:3, pp:217-224 [Journal]
  39. Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
    Improved worst-case complexity for the MIN 3-SET COVERING problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:2, pp:205-210 [Journal]
  40. Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos
    Time slot scheduling of compatible jobs. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2007, v:10, n:2, pp:111-127 [Journal]
  41. Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos
    Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2004, v:7, n:1, pp:85-91 [Journal]
  42. Vassilis Zissimopoulos, Vangelis Th. Paschos, Ferhan Pekergin
    On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1991, v:40, n:12, pp:1413-1418 [Journal]
  43. Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos
    Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:339, n:2-3, pp:272-292 [Journal]
  44. Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière
    On the differential approximation of MIN SET COVER. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:497-513 [Journal]
  45. Joë Blot, Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad
    Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:267-298 [Journal]
  46. Marc Demange, Pascal Grisoni, Vangelis Th. Paschos
    Differential Approximation Algorithms for Some Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:209, n:1-2, pp:107-122 [Journal]
  47. Marc Demange, Vangelis Th. Paschos
    On-line vertex-covering. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:83-108 [Journal]
  48. Marc Demange, Vangelis Th. Paschos
    On an Approximation Measure Founded on the Links Between Optimization and Polynomial Approximation Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:158, n:1&2, pp:117-141 [Journal]
  49. Bruno Escoffier, Vangelis Th. Paschos
    Completeness in approximation classes beyond APX. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:369-377 [Journal]
  50. Cécile Murat, Vangelis Th. Paschos
    A priori optimization for the probabilistic maximum independent set problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:561-590 [Journal]
  51. Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
    Optima locaux garantis pour l'approximation différentielle. [Citation Graph (0, 0)][DBLP]
    Technique et Science Informatiques, 2003, v:22, n:3, pp:257-288 [Journal]
  52. Giorgio Ausiello, Vangelis Th. Paschos
    Reductions, completeness and the hardness of approximability. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:172, n:3, pp:719-739 [Journal]
  53. Bruno Escoffier, Vangelis Th. Paschos
    Differential approximation of min sat. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:181, n:2, pp:620-633 [Journal]
  54. Vangelis Th. Paschos
    Jon Lee, A First Course in Combinatorial Optimization, Cambridge Texts in Applied Mathematics. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:168, n:3, pp:1042-1044 [Journal]
  55. Marc Demange, Vangelis Th. Paschos
    Polynomial approximation algorithms with performance guarantees: An introduction-by-example. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:165, n:3, pp:555-568 [Journal]
  56. Mhand Hifi, Vangelis Th. Paschos, Vassilis Zissimopoulos
    A simulated annealing approach for the circular cutting problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:159, n:2, pp:430-448 [Journal]
  57. Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
    Differential approximation results for the traveling salesman problem with distances 1 and 2. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:145, n:3, pp:557-568 [Journal]
  58. Cristina Bazgan, Vangelis Th. Paschos
    Differential approximation for optimal satisfiability and related problems. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:147, n:2, pp:397-404 [Journal]
  59. Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos
    Steiner Forests on Stochastic Metric Graphs. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:112-123 [Conf]

  60. Greedy algorithms for on-line set-covering and related problems. [Citation Graph (, )][DBLP]


  61. The max quasi-independent set Problem. [Citation Graph (, )][DBLP]


  62. Exact Algorithms for Dominating Clique Problems. [Citation Graph (, )][DBLP]


  63. An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs. [Citation Graph (, )][DBLP]


  64. Fast Algorithms for min independent dominating set. [Citation Graph (, )][DBLP]


  65. A Bottom-Up Method and Fast Algorithms for max independent set. [Citation Graph (, )][DBLP]


  66. Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n). [Citation Graph (, )][DBLP]


  67. Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. [Citation Graph (, )][DBLP]


  68. On the Maximum Edge Coloring Problem. [Citation Graph (, )][DBLP]


  69. On the Performance of Congestion Games for Optimum Satisfiability Problems. [Citation Graph (, )][DBLP]


  70. Vertex-Uncertainty in Graph-Problems. [Citation Graph (, )][DBLP]


  71. Approximating the Max Edge-Coloring Problem. [Citation Graph (, )][DBLP]


  72. Fast Algorithms for Max Independent Set in Graphs of Small Average Degree [Citation Graph (, )][DBLP]


  73. Max Edge Coloring of Trees [Citation Graph (, )][DBLP]


  74. Fast algorithms for min independent dominating set [Citation Graph (, )][DBLP]


  75. Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. [Citation Graph (, )][DBLP]


  76. Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.455secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002