Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Francis, Mathew C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Partially polynomial kernels for
Set Cover
and
Test Cover
Manu Basavaraju
,
Mathew C. Francis
,
M.S. Ramanujan
,
Saket Saurabh
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 67-78
Cubicity and bandwidth
L. Sunil Chandran
,
Mathew C. Francis
,
Naveen Sivadasan
Graphs and Combinatorics
29
(1), 2013, pp. 45-69
The maximum clique problem in multiple interval graphs
Mathew C. Francis
,
Daniel Gonçalves
,
Pascal Ochem
Lecture Notes in Computer Science
7551
, 2012, pp. 57-68
The maximum clique problem in multiple interval graphs
Mathew C. Francis
,
Daniel Gonçalves
,
Pascal Ochem
Lecture Notes in Computer Science
7551
, 2012, pp. 57-68
Boxicity of leaf powers
L. Sunil Chandran
,
Mathew C. Francis
,
Rogers Mathew
Graphs and Combinatorics
27
(1), 2011, pp. 61-72
Chordal bipartite graphs with high boxicity
L. Sunil Chandran
,
Mathew C. Francis
,
Rogers Mathew
Graphs and Combinatorics
27
(3), 2011, pp. 353-362
Geometric representation of graphs in low dimension using axis parallel boxes
L. Sunil Chandran
,
Mathew C. Francis
,
Naveen Sivadasan
Algorithmica
56
(2), 2010, pp. 129-140
Non-contractible non-edges in 2-connected graphs
Anita Das
,
Mathew C. Francis
,
Rogers Mathew
,
N. Sadagopan
Information Processing Letters
110
(23), 2010, pp. 1044-1048
On the cubicity of interval graphs
L. Sunil Chandran
,
Mathew C. Francis
,
Naveen Sivadasan
Graphs and Combinatorics
25
(2), 2009, pp. 169-179
Boxicity and maximum degree
L. Sunil Chandran
,
Mathew C. Francis
,
Naveen Sivadasan
Journal of Combinatorial Theory Series B
98
(2), 2008, pp. 443-445