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
Hilfe
Suche: Author="Feder, Tom{\'a}s"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graphs admitting
k
-NU operations. Part 2: The irreflexive case
Tomás Feder
,
Pavol Hell
,
Benoît Larose
,
Mark Siggers
,
Claude Tardif
SIAM Journal on Discrete Mathematics
28
(2), 2014, pp. 817-834
Graphs admitting
k
-NU operations. Part 1: The reflexive case
Tomás Feder
,
Pavol Hell
,
Benoît Larose
,
Cynthia Loten
,
Mark Siggers
,
Claude Tardif
SIAM Journal on Discrete Mathematics
27
(4), 2013, pp. 1940-1963
Edge-coloring almost bipartite multigraphs
Tomás Feder
,
Carlos Subi
Information Processing Letters
113
(18), 2013, pp. 685-689
On the complexity of MMSNP
Manuel Bodirsky
,
Hubie Chen
,
Tomás Feder
SIAM Journal on Discrete Mathematics
26
(1), 2012, pp. 404-414
Maximum gap labelings of graphs
Tomás Feder
,
Carlos Subi
Information Processing Letters
111
(4), 2011, pp. 169-173
Retractions to pseudoforests
Tomás Feder
,
Pavol Hell
,
Peter Jonsson
,
Andrei Krokhin
,
Gustav Nordh
SIAM Journal on Discrete Mathematics
24
(1), 2010, pp. 101-112
Approximating the Minimum Chain Completion problem
Tomás Feder
,
Heikki Mannila
,
Evimaria Terzi
Information Processing Letters
109
(17), 2009, pp. 980-985
Brooks-type theorems for pair-list colorings and list homomorphisms
Tomás Feder
,
Pavol Hell
,
Jing Huang
SIAM Journal on Discrete Mathematics
22
(1), 2008, pp. 1-14
Computing shortest paths with uncertainty
Tomás Feder
,
Rajeev Motwani
,
Liadan O'Callaghan
,
Chris Olston
,
Rina Panigrahy
J. Algorithms: Cognition, Informatics and Logic
62
(1), 2007, pp. 1-18
Classification of bipartite Boolean constraint satisfaction through delta-matroid intersection
Tomás Feder
,
Daniel Ford
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 372-394
A dichotomy theorem on fixed points of several nonexpansive mappings
Tomás Feder
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 291-301
List matrix partitions of chordal graphs
Tomás Feder
,
Pavol Hell
,
Sulamita Klein
,
Loana Tito Nogueira
,
Fábio Protti
Theoretical Computer Science
349
(1), 2005, pp. 52-66
Disks on a tree: Analysis of a combinatorial game
Tomás Feder
,
Carlos Subi
SIAM Journal on Discrete Mathematics
19
(3), 2005, pp. 543-552
Algorithms for multi-product pricing
Gagan Aggarwal
,
Tomás Feder
,
Rajeev Motwani
,
An Zhu
Lecture Notes in Computer Science
3142
, 2004, pp. 72-83
Dichotomies for classes of homomorphism problems involving unary functions
Tomás Feder
,
Florent Madelaine
,
Iain A. Stewart
Theoretical Computer Science
314
(1-2), 2004, pp. 1-43
Combining request scheduling with web caching
Tomás Feder
,
Rajeev Motwani
,
Rina Panigrahy
,
Steve Seiden
,
Rob van Stee
,
An Zhu
Theoretical Computer Science
324
(2-3), 2004, pp. 201-218
A combinatorial algorithm for MAX CSP
Mayur Datar
,
Tomás Feder
,
Aristides Gionis
,
Rajeev Motwani
,
Rina Panigrahy
Information Processing Letters
85
(6), 2003, pp. 307-315
Classification of homomorphisms to oriented cycles and of
k
-partite satisfiability
Tomás Feder
SIAM Journal on Discrete Mathematics
14
(4), 2001, pp. 471-480
A sublinear parallel algorithm for stable matching
Tomás Feder
,
Nimrod Megiddo
,
Serge A. Plotkin
Theoretical Computer Science
233
(1-2), 2000, pp. 297-308
The computational structure of monotone monadic
SNP
and constraint satisfaction: A study through Datalog and group theory
Tomás Feder
,
Moshe Y. Vardi
SIAM Journal on Computing
28
(1), 1998, pp. 57-104
The benefits of relaxing punctuality
Rajeev Alur
,
Tomás Feder
,
Thomas A. Henzinger
Journal of the ACM
43
(1), 1996, pp. 116-146
Clique partitions, graph compression and speeding-up algorithms
Tomás Feder
,
Rajeev Motwani
Journal of Computer and System Sciences
51
(2), 1995, pp. 261-272
A sublinear parallel algorithm for stable matching
Tomás Feder
,
Nimrod Megiddo
,
Serge A. Plotkin
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 632-637
Monotone monadic SNP and constraint satisfaction
Tomás Feder
,
Moshe Y. Vardi
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 612-622
Determinism vs.\ nondeterminism in multiparty communication complexity
Danny Dolev
,
Tomás Feder
SIAM Journal on Computing
21
(5), 1992, October, pp. 889-895
Seiten 1
2
>