default search action
Konstantinos Papalamprou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j13]Konstantinos Papalamprou, Leonidas S. Pitsoulis, Balázs Kotnyek:
A mathematical programming approach for recognizing binet matrices. Optim. Lett. 18(6): 1511-1532 (2024) - [j12]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
- [j11]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) - [j10]Konstantinos Papalamprou:
On the basis pair graphs of signed-graphic matroids. Discret. Math. Algorithms Appl. 13(4): 2150033:1-2150033:5 (2021) - 2020
- [j9]Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta
:
Binary signed-graphic matroids: Representations and recognition algorithms. Discret. Math. 343(7): 111887 (2020) - 2019
- [j8]Konstantinos Papalamprou, Christoforos L. Raptopoulos:
Balance in random signed intersection graphs. Australas. J Comb. 75: 50-65 (2019) - 2018
- [j7]Konstantinos Papalamprou:
On characterizing the extreme points of the generalized transitive tournament polytope. Electron. Notes Discret. Math. 68: 275-280 (2018) - 2017
- [j6]Konstantinos Papalamprou, Leonidas S. Pitsoulis:
Signed-graphic matroids with all-graphic cocircuits. Discret. Math. 340(12): 2889-2899 (2017) - [j5]Konstantinos Papalamprou, Leonidas S. Pitsoulis:
k-Sum decomposition of strongly unimodular matrices. Optim. Lett. 11(2): 407-418 (2017) - 2013
- [j4]Konstantinos Papalamprou, Leonidas S. Pitsoulis:
Decomposition of Binary Signed-Graphic Matroids. SIAM J. Discret. Math. 27(2): 669-692 (2013) - 2009
- [j3]Christos T. Maravelias
Polyhedral results for discrete-time production planning MIP formulations for continuous processes. Comput. Chem. Eng. 33(11): 1890-1904 (2009) - [j2]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) - 2007
- [j1]Gautam Appa, Balázs Kotnyek, Konstantinos Papalamprou, Leonidas S. Pitsoulis:
Optimization with binet matrices. Oper. Res. Lett. 35(3): 345-352 (2007)
Conference and Workshop Papers
- 2018
- [c3]Konstantinos Papalamprou, Efthymios P. Pournaras, Styliani Tychalaki:
A Mathematical Programming Approach for the Optimal Collateral Allocation Problem. OR 2018: 209-215 - 2012
- [c2]Konstantinos Papalamprou, Leonidas S. Pitsoulis:
Recognition Algorithms for Binary Signed-Graphic Matroids. ISCO 2012: 463-474 - 2009
- [c1]Konstantinos Papalamprou, Leonidas S. Pitsoulis:
Regular Matroids with Graphic Cocircuits. ACAC 2009: 29-41
Informal and Other Publications
- 2015
- [i2]Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta:
On the decomposition of quaternary signed-graphic matroids. CTW 2015: 181-184 - 2010
- [i1]Leonidas S. Pitsoulis, Konstantinos Papalamprou:
Decomposition of Binary Signed-Graphic Matroids. CoRR abs/1011.6497 (2010)
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:17 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: