Konstantinos Papalamprou

According to our database, Konstantinos Papalamprou authored at least 16 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

A mathematical programming approach for recognizing binet matrices.

Konstantinos Papalamprou, Leonidas S. Pitsoulis, Balázs Kotnyek

Optim. Lett., July, 2024

Decomposition of Quaternary Signed-Graphic Matroids.

Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta

SIAM J. Discret. Math., 2024

2021

On the basis pair graphs of signed-graphic matroids.

Konstantinos Papalamprou

Discret. Math. Algorithms Appl., 2021

On characterizing the class of cographic signed-graphic matroids.

Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta

Discret. Appl. Math., 2021

2020

Binary signed-graphic matroids: Representations and recognition algorithms.

Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta

Discret. Math., 2020

2019

Balance in random signed intersection graphs.

Konstantinos Papalamprou, Christoforos L. Raptopoulos

Australas. J Comb., 2019

2018

On characterizing the extreme points of the generalized transitive tournament polytope.

Konstantinos Papalamprou

Electron. Notes Discret. Math., 2018

A Mathematical Programming Approach for the Optimal Collateral Allocation Problem.

Konstantinos Papalamprou, Efthymios P. Pournaras, Styliani Tychalaki

Proceedings of the Operations Research Proceedings 2018, 2018

2017

k-Sum decomposition of strongly unimodular matrices.

Konstantinos Papalamprou, Leonidas S. Pitsoulis

Optim. Lett., 2017

Signed-graphic matroids with all-graphic cocircuits.

Konstantinos Papalamprou, Leonidas S. Pitsoulis

Discret. Math., 2017

2013

Decomposition of Binary Signed-Graphic Matroids.

Konstantinos Papalamprou, Leonidas S. Pitsoulis

SIAM J. Discret. Math., 2013

2012

Recognition Algorithms for Binary Signed-Graphic Matroids.

Konstantinos Papalamprou, Leonidas S. Pitsoulis

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2009

On the representability of totally unimodular matrices on bidirected graphs.

Leonidas S. Pitsoulis, Konstantinos Papalamprou, Gautam Appa, Balázs Kotnyek

Discret. Math., 2009

Regular Matroids with Graphic Cocircuits

Konstantinos Papalamprou, Leonidas S. Pitsoulis

Proceedings of the Proceedings Fourth Athens Colloquium on Algorithms and Complexity, 2009

Polyhedral results for discrete-time production planning MIP formulations for continuous processes.

Christos T. Maravelias, Konstantinos Papalamprou

Comput. Chem. Eng., 2009

2007

Optimization with binet matrices.

Gautam Appa, Balázs Kotnyek, Konstantinos Papalamprou, Leonidas S. Pitsoulis

Oper. Res. Lett., 2007