José Coelho de Pina

According to our database, José Coelho de Pina authored at least 11 papers between 2000 and 2021.

Collaborative distances:

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

2021

Cubic Graphs, Their Ehrhart Quasi-Polynomials, and a Scissors Congruence Phenomenon.

Cristina G. Fernandes, José Coelho de Pina, Jorge Luis Ramírez Alfonsín, Sinai Robins

Discret. Comput. Geom., 2021

On the period collapse of a family of Ehrhart quasi-polynomials.

Cristina G. Fernandes, José Coelho de Pina, Jorge L. Ramírez Alfonsín, Sinai Robins

CoRR, 2021

2019

Counting Hamiltonian Cycles in the Matroid Basis Graph.

Cristina G. Fernandes, César Hernández-Vélez, José Coelho de Pina, Jorge Luis Ramírez Alfonsín

Graphs Comb., 2019

2016

Spanning trees with nonseparating paths.

Cristina G. Fernandes, César Hernández-Vélez, Orlando Lee, José Coelho de Pina

Discret. Math., 2016

2010

A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem

Paulo Feofiloff, Cristina G. Fernandes, Carlos Eduardo Ferreira, José Coelho de Pina

CoRR, 2010

2007

Algorithms for terminal Steiner trees.

Fábio Viduani Martinez, José Coelho de Pina, José Soares

Theor. Comput. Sci., 2007

Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem.

Paulo Feofiloff, Cristina G. Fernandes, Carlos Eduardo Ferreira, José Coelho de Pina

Inf. Process. Lett., 2007

2004

Lempel, Even, and Cederbaum Planarity Method.

John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003

Improved bound for the Carathéodory rank of the bases of a matroid.

José Coelho de Pina, José Soares

J. Comb. Theory, Ser. B, 2003

2002

Length-bounded disjoint paths in planar graphs.

Hein van der Holst, José Coelho de Pina

Discret. Appl. Math., 2002

2000

A new bound for the Carathéodory rank of the bases of a matroid.

José Coelho de Pina, José Soares

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000