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

Search the dblp DataBase

Title:
Author:
Panos M. Pardalos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mario R. Guarracino, C. Cifarelli, O. Seref, Panos M. Pardalos
    A Parallel Classification Method for Genomic and Proteomic Problems. [Citation Graph (0, 0)][DBLP]
    AINA (2), 2006, pp:588-592 [Conf]
  2. B. N. Khoury, Panos M. Pardalos
    An Exact Branch and Bound Algorithm for the Steiner Problem in Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:582-590 [Conf]
  3. Fernando de Carvalho Gomes, Panos M. Pardalos, Carlos A. S. Oliveira, Mauricio G. C. Resende
    Reactive GRASP with path relinking for channel assignment in mobile phone networks. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2001, pp:60-67 [Conf]
  4. Marco D'Apuzzo, Marina Marino, Panos M. Pardalos, Gerardo Toraldo
    A Parallel Implementation of a Potential Reduction Algorithm for Box-Constrained Quadratic Programming. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:839-848 [Conf]
  5. Cheong Hee Park, Haesun Park, Panos M. Pardalos
    A Comparative Study of Linear and Nonlinear Feature Extraction Methods. [Citation Graph (0, 0)][DBLP]
    ICDM, 2004, pp:495-498 [Conf]
  6. Guoliang Xue, J. Ben Rosen, Panos M. Pardalos
    A Polynomial Time Dual Algorithm for the Euclidean Multifacility Location Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:227-236 [Conf]
  7. Renata M. Aiex, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
    A GRASP for Computing Approximate Solutions for the Three-Index Assignment Problem. [Citation Graph (0, 0)][DBLP]
    IPDPS Workshops, 2000, pp:504- [Conf]
  8. Carlos A. S. Oliveira, Panos M. Pardalos
    A Distributed Optimization Algorithm for Power Control in Wireless Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  9. Panos M. Pardalos, Leonidas S. Pitsoulis, T. Mavridou, Mauricio G. C. Resende
    Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1995, pp:317-331 [Conf]
  10. Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
    A Parallel GRASP for MAX-SAT Problems. [Citation Graph (0, 0)][DBLP]
    PARA, 1996, pp:575-585 [Conf]
  11. Sergiy Butenko, Panos M. Pardalos, Ivan Sergienko, Vladimir Shylo, Petro Stetsyuk
    Finding maximum independent sets in graphs arising from coding theory. [Citation Graph (0, 0)][DBLP]
    SAC, 2002, pp:542-546 [Conf]
  12. Afonso Ferreira, Panos M. Pardalos
    SCOOP: Solving Combinatorial Optimization Problems in Parallel. [Citation Graph (0, 0)][DBLP]
    Solving Combinatorial Optimization Problems in Parallel, 1996, pp:1-6 [Conf]
  13. Panos M. Pardalos, Guoliang Xue, P. D. Panagiotopoulos
    Parallel algorithms for global optimization problems. [Citation Graph (0, 0)][DBLP]
    Solving Combinatorial Optimization Problems in Parallel, 1996, pp:232-247 [Conf]
  14. Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
    GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:367-379 [Conf]
  15. Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio G. C. Resende
    GRASP with Path-Relinking for the Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:356-368 [Conf]
  16. Panos M. Pardalos, Guoliang Xue
    Algorithms for a Class of Isotonic Regression Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:23, n:3, pp:211-222 [Journal]
  17. Panos M. Pardalos, Athanasios Migdalas
    A note on the complexity of longest path problems related to graph coloring. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2004, v:17, n:1, pp:13-15 [Journal]
  18. Vladimir Boginski, Sergiy Butenko, Panos M. Pardalos
    Network Models of Massive Datasets. [Citation Graph (0, 0)][DBLP]
    Comput. Sci. Inf. Syst., 2004, v:1, n:1, pp:- [Journal]
  19. Tom M. Cavalier, Panos M. Pardalos, Allen L. Soyster
    Modeling and integer programming techniques applied to propositional calculus. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1990, v:17, n:6, pp:561-570 [Journal]
  20. Carlos A. S. Oliveira, Panos M. Pardalos
    A survey of combinatorial optimization problems in multicast routing. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1953-1981 [Journal]
  21. Panos M. Pardalos, Gregory P. Rodgers
    A branch and bound algorithm for the maximum clique problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1992, v:19, n:5, pp:363-375 [Journal]
  22. Sandra Duni Eksioglu, H. Edwin Romeijn, Panos M. Pardalos
    Cross-facility management of production and transportation planning problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:11, pp:3231-3251 [Journal]
  23. Vladimir Boginski, Sergiy Butenko, Panos M. Pardalos
    Mining market data: A network approach. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:11, pp:3171-3184 [Journal]
  24. Fernando C. Gomes, Cláudio Nogueira de Meneses, Panos M. Pardalos, Gerardo Valdisio R. Viana
    Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3520-3534 [Journal]
  25. Dongsoo S. Kim, Ding-Zhu Du, Panos M. Pardalos
    A coloring problem on the n-cube. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:307-311 [Journal]
  26. Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos
    Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:100, n:1-2, pp:95-113 [Journal]
  27. Renata M. Aiex, Mauricio G. C. Resende, Panos M. Pardalos, Gerardo Toraldo
    GRASP with Path Relinking for Three-Index Assignment. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2005, v:17, n:2, pp:224-247 [Journal]
  28. Cláudio Nogueira de Meneses, Zhaosong Lu, Carlos A. S. Oliveira, Panos M. Pardalos
    Optimal Solutions for the Closest-String Problem via Integer Programming. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2004, v:16, n:4, pp:419-429 [Journal]
  29. M. Ericsson, Mauricio G. C. Resende, Panos M. Pardalos
    A Genetic Algorithm for the Weight Setting Problem in OSPF Routing. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2002, v:6, n:3, pp:299-333 [Journal]
  30. H. K. Fung, S. Rao, Christodoulos A. Floudas, Oleg A. Prokopyev, Panos M. Pardalos, F. Rendl
    Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:10, n:1, pp:41-60 [Journal]
  31. Stanislav Busygin, Sergiy Butenko, Panos M. Pardalos
    A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2002, v:6, n:3, pp:287-297 [Journal]
  32. Stanislav Busygin, Oleg A. Prokopyev, Panos M. Pardalos
    Feature Selection for Consistent Biclustering via Fractional 0-1 Programming. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:10, n:1, pp:7-21 [Journal]
  33. Wanpracha Chaovalitwongse, Dukwon Kim, Panos M. Pardalos
    GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2003, v:7, n:2, pp:179-207 [Journal]
  34. Leonidas D. Iasemidis, Panos M. Pardalos, J. Chris Sackellares, Deng-Shan Shiau
    Quadratic Binary Programming and Dynamical System Approach to Determine the Predictability of Epileptic Seizures. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:1, pp:9-26 [Journal]
  35. Yannis Marinakis, Athanasios Migdalas, Panos M. Pardalos
    A Hybrid Genetic-GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:10, n:4, pp:311-326 [Journal]
  36. Panos M. Pardalos
    Editorial. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:10, n:1, pp:5-5 [Journal]
  37. Panos M. Pardalos, Tianbing Qian, Mauricio G. C. Resende
    A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:4, pp:399-412 [Journal]
  38. Panos M. Pardalos, Henry Wolkowicz
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2002, v:6, n:3, pp:235-236 [Journal]
  39. Panos M. Pardalos, Henry Wolkowicz
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:1, pp:7-7 [Journal]
  40. Oleg A. Prokopyev, Panos M. Pardalos
    On Approximability of Boolean Formula Minimization. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2004, v:8, n:2, pp:129-135 [Journal]
  41. Oleg A. Prokopyev, Panos M. Pardalos
    Minimum elsilon-equivalent Circuit Size Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2004, v:8, n:4, pp:495-502 [Journal]
  42. Sanguthevar Rajasekaran, Y. Hu, Jun Luo, H. Nick, Panos M. Pardalos, Sartaj Sahni, G. Shaw
    Efficient Algorithms for Similarity Search. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:1, pp:125-132 [Journal]
  43. Sanguthevar Rajasekaran, H. Nick, Panos M. Pardalos, Sartaj Sahni, G. Shaw
    Efficient Algorithms for Local Alignment Search. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:1, pp:117-124 [Journal]
  44. Manki Min, Oleg A. Prokopyev, Panos M. Pardalos
    Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:11, n:1, pp:59-69 [Journal]
  45. Peter Sussner, Panos M. Pardalos, Gerhard X. Ritter
    On Integer Programming Approaches for Morphological Template Decomposition Problems in Computer Vision. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1997, v:1, n:2, pp:165-178 [Journal]
  46. Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Oliveira, Panos M. Pardalos
    On the number of local minima for the multidimensional assignment problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:13, n:1, pp:1-18 [Journal]
  47. Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
    GRASP with path relinking for the weighted MAXSAT problem. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal]
  48. Panos M. Pardalos, Wanpracha Chaovalitwongse, Leonidas D. Iasemidis, J. Chris Sackellares, Deng-Shan Shiau, Paul R. Carney, Oleg A. Prokopyev, Vitaliy A. Yatsenko
    Seizure warning algorithm based on optimization and nonlinear dynamics. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2004, v:101, n:2, pp:365-385 [Journal]
  49. Panos M. Pardalos, N. Kovoor
    An Algorithm for a Singly Constrained Class of Quadratic Programs Subject to Upper and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:46, n:, pp:321-328 [Journal]
  50. Panos M. Pardalos, Stephen A. Vavasis
    Open questions in complexity theory for numerical optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:337-339 [Journal]
  51. Pavlo A. Krokhmal, Don A. Grundel, Panos M. Pardalos
    Asymptotic behavior of the expected optimal value of the multidimensional assignment problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:109, n:2-3, pp:525-551 [Journal]
  52. Joseph Geunes, Panos M. Pardalos
    Network optimization in supply chain management and financial engineering: An annotated bibliography. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:2, pp:66-84 [Journal]
  53. Dukwon Kim, Panos M. Pardalos
    Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:3, pp:216-222 [Journal]
  54. Wanpracha Chaovalitwongse, Panos M. Pardalos, Oleg A. Prokopyev
    A new linearization technique for multi-quadratic 0-1 programming problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:517-522 [Journal]
  55. Dukwon Kim, Panos M. Pardalos
    A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:4, pp:195-203 [Journal]
  56. Oleg A. Prokopyev, Hong-Xuan Huang, Panos M. Pardalos
    On complexity of unconstrained hyperbolic 0-1 programming problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:3, pp:312-318 [Journal]
  57. Michael Doumpos, Constantin Zopounidis, Panos M. Pardalos
    Multicriteria sorting methodology: application to financial decision problems. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms Appl., 2000, v:15, n:1-2, pp:113-129 [Journal]
  58. Ricardo C. Corrêa, Fernando de Carvalho Gomes, Carlos A. S. Oliveira, Panos M. Pardalos
    A parallel implementation of an asynchronous team to the point-to-point connection problem. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2003, v:29, n:4, pp:447-466 [Journal]
  59. Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende
    Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 2001, v:27, n:4, pp:456-464 [Journal]
  60. Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
    Algorithm 769: Fortran Subroutines for Approximate Solution of Sparse Quadratic Assignment Problems Using GRASP. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1997, v:23, n:2, pp:196-208 [Journal]
  61. Mauricio G. C. Resende, Panos M. Pardalos, Yong Li
    Algorithm 754: Fortran Subroutines for Approximate Solution of Dense Quadratic Assignment Problems Using GRASP. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1996, v:22, n:1, pp:104-118 [Journal]
  62. Panos M. Pardalos, J. Chris Sackellares, Leonidas D. Iasemidis, Vitaliy A. Yatsenko, Mark C. K. Yang, Deng-Shan Shiau, Wanpracha Chaovalitwongse
    Statistical information approaches for the modelling of the epileptic brain. [Citation Graph (0, 0)][DBLP]
    Computational Statistics & Data Analysis, 2003, v:43, n:1, pp:79-108 [Journal]
  63. Panos M. Pardalos, Vitaliy A. Yatsenko, J. Chris Sackellares, Deng-Shan Shiau, Wanpracha Chaovalitwongse, Leonidas D. Iasemidis
    Analysis of EEG data using optimization, statistics, and dynamical system techniques. [Citation Graph (0, 0)][DBLP]
    Computational Statistics & Data Analysis, 2003, v:44, n:1-2, pp:391-408 [Journal]
  64. Vladimir Boginski, Sergiy Butenko, Panos M. Pardalos
    Statistical analysis of financial networks. [Citation Graph (0, 0)][DBLP]
    Computational Statistics & Data Analysis, 2005, v:48, n:2, pp:431-443 [Journal]
  65. Costas D. Maranas, Christodoulos A. Floudas, Panos M. Pardalos
    New results in the packing of equal circles in a square. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:287-293 [Journal]
  66. Manki Min, Panos M. Pardalos
    Total energy optimal multicasting in wireless ad hoc networks. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:13, n:4, pp:365-378 [Journal]

  67. A Novel Wavelet Based Algorithm for Spike and Wave Detection in Absence Epilepsy. [Citation Graph (, )][DBLP]


  68. Detecting Categorical Discrimination in a Visuomotor Task Using Selective Support Vector Machines. [Citation Graph (, )][DBLP]


  69. A Branch and Bound Algorithm for Multiple Instance Classification. [Citation Graph (, )][DBLP]


  70. Analysis of greedy approximations with nonsubmodular potential functions. [Citation Graph (, )][DBLP]


  71. Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs. [Citation Graph (, )][DBLP]


  72. Efficient Prediction of Protein-Protein Interactions Using Sequence Information. [Citation Graph (, )][DBLP]


  73. A Supervised Learning Technique and Its Applications to Computational Biology. [Citation Graph (, )][DBLP]


  74. A Retrospective Review of Social Networks. [Citation Graph (, )][DBLP]


  75. Predicting the Nexus between Post-Secondary Education Affordability and Student Success: An Application of Network-Based Approaches. [Citation Graph (, )][DBLP]


  76. K-T.R.A.C.E: A kernel k-means procedure for classification. [Citation Graph (, )][DBLP]


  77. Biclustering in data mining. [Citation Graph (, )][DBLP]


  78. Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. [Citation Graph (, )][DBLP]


  79. A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems. [Citation Graph (, )][DBLP]


  80. A parallel multistart algorithm for the closest string problem. [Citation Graph (, )][DBLP]


  81. Detecting critical nodes in sparse graphs. [Citation Graph (, )][DBLP]


  82. Erratum. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.459secs
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