default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeonidas S. Pitsoulis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Konstantinos Papalamprou, Leonidas S. Pitsoulis, Balázs Kotnyek:
A mathematical programming approach for recognizing binet matrices. Optim. Lett. 18(6): 1511-1532 (2024)- [j25]Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta:
Decomposition of Quaternary Signed-Graphic Matroids. SIAM J. Discret. Math. 38(4): 2599-2642 (2024) - 2021
- [j24]Pierre Miasnikof
, Alexander Y. Shestopaloff, Leonidas S. Pitsoulis, Alexander Ponomarenko:
An empirical comparison of connectivity-based distances on a graph and their computational scalability. J. Complex Networks 10(1) (2021) - [j23]Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta:
On characterizing the class of cographic signed-graphic matroids. Discret. Appl. Math. 296: 90-102 (2021) - 2020
- [j22]Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta:
Binary signed-graphic matroids: Representations and recognition algorithms. Discret. Math. 343(7): 111887 (2020) - [c10]Pierre Miasnikof, Alexander Y. Shestopaloff, Leonidas S. Pitsoulis, Alexander Ponomarenko, Yuri A. Lawryshyn:
Distances on a Graph. COMPLEX NETWORKS (1) 2020: 189-199 - [i4]Pierre Miasnikof, Alexander Y. Shestopaloff, Leonidas S. Pitsoulis, Yuri A. Lawryshyn:
Graph Distances and Clustering. CoRR abs/2004.03016 (2020)
2010 – 2019
- 2019
- [i3]Alexander Ponomarenko, Leonidas S. Pitsoulis, Marat Shamshetdinov:
Overlapping community detection in networks based on link partitioning and partitioning around medoids. CoRR abs/1907.08731 (2019) - 2017
- [j21]Konstantinos Papalamprou, Leonidas S. Pitsoulis:
Signed-graphic matroids with all-graphic cocircuits. Discret. Math. 340(12): 2889-2899 (2017) - [j20]George Zioutas, Christos Chatzinakos, Tri-Dung Nguyen, Leonidas S. Pitsoulis:
Optimization techniques for multivariate least trimmed absolute deviation estimation. J. Comb. Optim. 34(3): 781-797 (2017) - [j19]Konstantinos Papalamprou, Leonidas S. Pitsoulis:
k-Sum decomposition of strongly unimodular matrices. Optim. Lett. 11(2): 407-418 (2017) - 2016
- [j18]Christos Chatzinakos, Leonidas S. Pitsoulis, George Zioutas:
Optimization techniques for robust multivariate location and scatter estimation. J. Comb. Optim. 31(4): 1443-1460 (2016) - 2015
- [j17]Theodoros P. Gevezes, Leonidas S. Pitsoulis:
A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem. J. Comb. Optim. 29(4): 859-883 (2015) - [i2]Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta:
On the decomposition of quaternary signed-graphic matroids. CTW 2015: 181-184 - 2014
- [j16]Theodoros P. Gevezes, Leonidas S. Pitsoulis:
Recognition of overlap graphs. J. Comb. Optim. 28(1): 25-37 (2014) - 2013
- [j15]Mariá Cristina Vasconcelos Nascimento, Leonidas S. Pitsoulis:
Community detection by modularity maximization using GRASP with path relinking. Comput. Oper. Res. 40(12): 3121-3131 (2013) - [j14]Theodoros P. Gevezes, Leonidas S. Pitsoulis:
A new greedy algorithm for the quadratic assignment problem. Optim. Lett. 7(2): 207-220 (2013) - [j13]Konstantinos Papalamprou, Leonidas S. Pitsoulis:
Decomposition of Binary Signed-Graphic Matroids. SIAM J. Discret. Math. 27(2): 669-692 (2013) - 2012
- [c9]Konstantinos Papalamprou, Leonidas S. Pitsoulis:
Recognition Algorithms for Binary Signed-Graphic Matroids. ISCO 2012: 463-474 - 2010
- [j12]Leonidas S. Pitsoulis, George Zioutas:
A fast algorithm for robust regression with penalised trimmed squares. Comput. Stat. 25(4): 663-689 (2010) - [i1]Leonidas S. Pitsoulis, Konstantinos Papalamprou:
Decomposition of Binary Signed-Graphic Matroids. CoRR abs/1011.6497 (2010)
2000 – 2009
- 2009
- [j11]George Zioutas, Leonidas S. Pitsoulis, Antonios Avramidis:
Quadratic mixed integer programming and support vectors for deleting outliers in robust regression. Ann. Oper. Res. 166(1): 339-353 (2009) - [j10]Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitsoulis:
Persistency and matroid intersection. Comput. Manag. Sci. 6(4): 435-445 (2009) - [j9]Leonidas S. Pitsoulis, Konstantinos Papalamprou, Gautam Appa, Balázs Kotnyek:
On the representability of totally unimodular matrices on bidirected graphs. Discret. Math. 309(16): 5024-5042 (2009) - [c8]Konstantinos Papalamprou, Leonidas S. Pitsoulis:
Regular Matroids with Graphic Cocircuits. ACAC 2009: 29-41 - [r5]Leonidas S. Pitsoulis:
Affine Sets and Functions. Encyclopedia of Optimization 2009: 26 - [r4]Leonidas S. Pitsoulis:
Biquadratic Assignment Problem. Encyclopedia of Optimization 2009: 293-294 - [r3]Leonidas S. Pitsoulis:
Linear Space. Encyclopedia of Optimization 2009: 1901-1902 - [r2]Leonidas S. Pitsoulis, Panos M. Pardalos:
Quadratic Assignment Problem. Encyclopedia of Optimization 2009: 3119-3149 - [r1]Leonidas S. Pitsoulis:
Quadratic Semi-assignment Problem. Encyclopedia of Optimization 2009: 3170-3171 - 2007
- [j8]Gautam Appa, Balázs Kotnyek, Konstantinos Papalamprou, Leonidas S. Pitsoulis:
Optimization with binet matrices. Oper. Res. Lett. 35(3): 345-352 (2007) - 2006
- [j7]Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitsoulis:
The Matching Predicate and a Filtering Scheme Based on Matroids. J. Comput. 1(6): 37-42 (2006) - [j6]Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende:
GRASP with path relinking for the weighted MAXSAT problem. ACM J. Exp. Algorithmics 11 (2006) - [c7]Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitsoulis:
Consistency of the Matching Predicate. SETN 2006: 555-558 - 2005
- [j5]Eduardo L. Pasiliao, Panos M. Pardalos, Leonidas S. Pitsoulis:
Branch and bound algorithms for the multidimensional assignment problem. Optim. Methods Softw. 20(1): 127-143 (2005) - [c6]Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende:
GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem. WEA 2005: 367-379 - 2001
- [j4]Leonidas S. Pitsoulis, Panos M. Pardalos, Donald W. Hearn:
Approximate solutions to the turbine balancing problem. Eur. J. Oper. Res. 130(1): 147-155 (2001) - 2000
- [j3]Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos:
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP. Discret. Appl. Math. 100(1-2): 95-113 (2000) - [c5]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. IPDPS Workshops 2000: 504
1990 – 1999
- 1998
- [j2]Thelma D. Mavridou, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende:
A GRASP for the biquadratic assignment problem. Eur. J. Oper. Res. 105(3): 613-621 (1998) - 1997
- [j1]Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende:
Algorithm 769: Fortran Subroutines for Approximate Solution of Sparse Quadratic Assignment Problems Using GRASP. ACM Trans. Math. Softw. 23(2): 196-208 (1997) - [c4]Robert A. Murphey, Panos M. Pardalos, Leonidas S. Pitsoulis:
A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. Network Design: Connectivity and Facilities Location 1997: 277-301 - 1996
- [c3]Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos:
Approximate solution of weighted MAX-SAT problems using GRASP. Satisfiability Problem: Theory and Applications 1996: 393-405 - [c2]Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende:
A Parallel GRASP for MAX-SAT Problems. PARA 1996: 575-585 - 1995
- [c1]Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D. Mavridou, Mauricio G. C. Resende:
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP. IRREGULAR 1995: 317-331
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
