activity
20092020
most citedA Fast Algorithm for Robust Regression with Penalised Trimmed Squares

8 citations · 21 across the 11 of their papers we have counts for

collaborators
Showing math.COShow all

6 papers · 1 filter

math.CO2015

Decomposition of Quaternary Signed-Graphic Matroids

Leonidas Pitsoulis, Eleni-Maria Vretta

In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matr…

math.CO2012

Binary Matroids with Graphic Cocircuits

Konstantinos Papalamprou, Leonidas Pitsoulis

An excluded minor characterization for the class of binary signed-graphic matroids with graphic cocircuits is provided. In this report we present the necessary computations for the…

math.CO2011

-Sum Decomposition of Strongly Unimodular Matrices

Konstantinos Papalamprou, Leonidas Pitsoulis

Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroid…

math.CO2010

Recognition algorithms for binary signed-graphic matroids

Leonidas Pitsoulis, Konstantinos Papalamprou

In this paper we provide two recognition algorithms for the class of signed-graphic matroids along with necessary and sufficient conditions for a matroid to be signed-graphic. Spec…

math.CO2010★ 1 cited

Decomposition of Binary Signed-Graphic Matroids

Konstantinos Papalamprou, Leonidas Pitsoulis

In this paper we employ Tutte's theory of bridges to derive a decomposition theorem for binary matroids arising from signed graphs. The proposed decomposition differs from previous…

math.CO2009★ 7 cited

On the representability of totally unimodular matrices on bidirected graphs

L. Pitsoulis, K. Papalamprou, G. Appa +1

Seymour's famous decomposition theorem for regular matroids states that any totally unimodular (TU) matrix can be constructed through a series of composition operations called -…