Projects
Reading
People
Chat
SU\G
(đž)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Paolo Nobili
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
PDF
Chat
Power Reduction in FM Networks by Mixed-Integer Programming: A Case Study
2024
Pasquale Avella
Paolo Nobili
Antonio Sassano
+
Power Reduction in FM Networks by Mixed-Integer Programming. A Case Study
2023
Pasquale Avella
Paolo Nobili
Antonio Sassano
+
An <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi mathvariant="script">O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:msqrt><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msqrt><mml:mo>)</mml:mo></mml:mrow></mml:math> algorithm for the weighted stable set problem in {claw, net}-free graphs with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>α</âŠ
2016
Paolo Nobili
Antonio Sassano
+
An ${\cal O}(n\sqrt{m})$ algorithm for the weighted stable set problem in {claw, net}-free graphs with $\alpha(G) \ge 4$
2015
Paolo Nobili
Antonio Sassano
+
An ${\cal O}(m\log n)$ algorithm for the weighted stable set problem in claw-free graphs with $α({G}) \le 3$
2015
Paolo Nobili
Antonio Sassano
+
An ${\cal O}(n^2 \log(n))$ algorithm for the weighted stable set problem in claw-free graphs
2015
Paolo Nobili
Antonio Sassano
+
An ${\cal O}(n\sqrt{m})$ algorithm for the weighted stable set problem in {claw, net}-free graphs with $α(G) \ge 4$
2015
Paolo Nobili
Antonio Sassano
+
A reduction algorithm for the weighted stable set problem in claw-free graphs
2013
Paolo Nobili
Antonio Sassano
+
A reduction algorithm for the weighted stable set problem in claw-free graphs.
2011
Paolo Nobili
Antonio Sassano
+
Non-regular square bipartite designs
2002
Caterina De Simone
Grigor Gasparyan
Paolo Nobili
+
On the chromatic polynomial of a graph
2002
David Avis
Caterina De Simone
Paolo Nobili
+
Two Conjectures on the Chromatic Polynomial
2000
David Avis
Caterina De Simone
Paolo Nobili
+
(0, ±1) ideal matrices
1998
Paolo Nobili
Antonio Sassano
+
(0, ±1) ideal matrices
1995
Paolo Nobili
Antonio Sassano
+
Weak cutset composition of covering polytopes
1994
Paolo Nobili
Antonio Sassano
Common Coauthors
Coauthor
Papers Together
Antonio Sassano
12
Caterina De Simone
3
David Avis
2
Pasquale Avella
2
Grigor Gasparyan
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition
2014
Yuri Faenza
Gianpaolo Oriolo
Gautier Stauffer
4
+
On maximal independent sets of vertices in claw-free graphs
1980
George J. Minty
4
+
On Lehmanâs width-length characterization
1991
Paul Seymour
3
+
Proof of a Chromatic Polynomial Conjecture
2000
Fengming Dong
2
+
PDF
Chat
The structure of claw-free graphs
2005
Maria Chudnovsky
Paul Seymour
2
+
Ideal 0, 1 Matrices
1994
Gérard Cornuéjols
Beth Novick
2
+
The Markov chain of colourings
1995
J. Eric Bartels
Dominic Welsh
2
+
A Strengthening of Ben RebeaâČs Lemma
1993
JeanâLuc Fouquet
2
+
Imperfect and Nonideal Clutters: A Common Approach
2003
Grigor Gasparyan
Myriam Preissmann
Andrïżœs Sebo
1
+
Lehman's forbidden minor characterization of ideal 0â1 matrices
1993
Manfred Padberg
1
+
A characterization of perfect graphs
1972
LĂĄszlĂł LovĂĄsz
1
+
On a combinatorial problem
1948
FA Dick de Bruijn
P. ErdĆs
1
+
An <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi mathvariant="script">O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:msqrt><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msqrt><mml:mo>)</mml:mo></mml:mrow></mml:math> algorithm for the weighted stable set problem in {claw, net}-free graphs with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>α</âŠ
2016
Paolo Nobili
Antonio Sassano
1
+
Matching Theory (North-Holland mathematics studies)
1986
LĂĄszlĂł LovĂĄsz
1
+
Mathematical Programming
1995
Brian Conolly
S. Vajda
1
+
On the decomposition of graphs into complete bipartite subgraphs
1983
Fan Chung
PĂ©ter L. ErdĆs
J. Spencer
1
+
An ${\cal O}(m\log n)$ algorithm for the weighted stable set problem in claw-free graphs with $α({G}) \le 3$
2015
Paolo Nobili
Antonio Sassano
1
+
Minimal imperfect graphs: A simple approach
1996
Gennady Gasparian
1
+
PDF
Chat
Expansions of chromatic polynomials and log-concavity
1992
Francesco Brenti
1
+
Surveys in Combinatorics 2005
2005
B. S Webb
1
+
An algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem
2011
Yuri Faenza
Gianpaolo Oriolo
Gautier Stauffer
1
+
Two Chromatic Polynomial Conjectures
1997
Paul Seymour
1