Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Tomás Feder
@article{DBLP:journals/dm/BokBFHJ23,
author = {Jan Bok and
Richard C. Brewster and
Tom{\'{a}}s Feder and
Pavol Hell and
Nikola Jedlickov{\'{a}}},
title = {List homomorphism problems for signed trees},
journal = {Discret. Math.},
volume = {346},
number = {3},
pages = {113257},
year = {2023},
url = {https://doi.org/10.1016/j.disc.2022.113257},
doi = {10.1016/J.DISC.2022.113257},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BokBFHJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-06449,
author = {Jan Bok and
Richard C. Brewster and
Tom{\'{a}}s Feder and
Pavol Hell and
Nikola Jedlickov{\'{a}}},
title = {List homomorphisms to separable signed graphs},
journal = {CoRR},
volume = {abs/2306.06449},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.06449},
doi = {10.48550/ARXIV.2306.06449},
eprinttype = {arXiv},
eprint = {2306.06449},
timestamp = {Fri, 16 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-06449.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/GhFFS22,
author = {Behrooz Bagheri Gh. and
Tom{\'{a}}s Feder and
Herbert Fleischner and
Carlos S. Subi},
title = {On Finding Hamiltonian Cycles in Barnette Graphs},
journal = {Fundam. Informaticae},
volume = {188},
number = {1},
pages = {1--14},
year = {2022},
url = {https://doi.org/10.3233/FI-222139},
doi = {10.3233/FI-222139},
timestamp = {Thu, 26 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fuin/GhFFS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/BokBFHJ22,
author = {Jan Bok and
Richard C. Brewster and
Tom{\'{a}}s Feder and
Pavol Hell and
Nikola Jedlickov{\'{a}}},
editor = {Niranjan Balachandran and
R. Inkulu},
title = {List Homomorphisms to Separable Signed Graphs},
booktitle = {Algorithms and Discrete Applied Mathematics - 8th International Conference,
{CALDAM} 2022, Puducherry, India, February 10-12, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13179},
pages = {22--35},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-030-95018-7\_3},
doi = {10.1007/978-3-030-95018-7\_3},
timestamp = {Tue, 08 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/caldam/BokBFHJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FederHS21,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Carlos S. Subi},
title = {Distance-two colourings of Barnette graphs},
journal = {Eur. J. Comb.},
volume = {91},
pages = {103210},
year = {2021},
url = {https://doi.org/10.1016/j.ejc.2020.103210},
doi = {10.1016/J.EJC.2020.103210},
timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/FederHS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GhFFS21,
author = {Behrooz Bagheri Gh. and
Tom{\'{a}}s Feder and
Herbert Fleischner and
Carlos S. Subi},
title = {Hamiltonian cycles in planar cubic graphs with facial 2-factors, and
a new partial solution of Barnette's Conjecture},
journal = {J. Graph Theory},
volume = {96},
number = {2},
pages = {269--288},
year = {2021},
url = {https://doi.org/10.1002/jgt.22612},
doi = {10.1002/JGT.22612},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/GhFFS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FederH20,
author = {Tom{\'{a}}s Feder and
Pavol Hell},
title = {Complexity of correspondence H-colourings},
journal = {Discret. Appl. Math.},
volume = {281},
pages = {235--245},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.11.005},
doi = {10.1016/J.DAM.2019.11.005},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/FederH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BokBFHJ20,
author = {Jan Bok and
Richard C. Brewster and
Tom{\'{a}}s Feder and
Pavol Hell and
Nikola Jedlickov{\'{a}}},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {List Homomorphism Problems for Signed Graphs},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {20:1--20:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.20},
doi = {10.4230/LIPICS.MFCS.2020.20},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/BokBFHJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-05547,
author = {Jan Bok and
Richard C. Brewster and
Tom{\'{a}}s Feder and
Pavol Hell and
Nikola Jedlickov{\'{a}}},
title = {List homomorphism problems for signed graphs},
journal = {CoRR},
volume = {abs/2005.05547},
year = {2020},
url = {https://arxiv.org/abs/2005.05547},
eprinttype = {arXiv},
eprint = {2005.05547},
timestamp = {Thu, 14 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-05547.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-00061,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Carlos S. Subi},
title = {Complexity of acyclic colorings of graphs and digraphs with degree
and girth constraints},
journal = {CoRR},
volume = {abs/1907.00061},
year = {2019},
url = {http://arxiv.org/abs/1907.00061},
eprinttype = {arXiv},
eprint = {1907.00061},
timestamp = {Mon, 08 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-00061.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/FederHS18,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Carlos S. Subi},
editor = {Stephane Durocher and
Shahin Kamali},
title = {Distance-Two Coloring of Barnette Graphs},
booktitle = {Proceedings of the 30th Canadian Conference on Computational Geometry,
{CCCG} 2018, August 8-10, 2018, University of Manitoba, Winnipeg,
Manitoba, Canada},
pages = {304--310},
year = {2018},
url = {http://www.cs.umanitoba.ca/\%7Ecccg2018/papers/session6B-p1.pdf},
timestamp = {Thu, 12 Mar 2020 11:28:29 +0100},
biburl = {https://dblp.org/rec/conf/cccg/FederHS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-01410,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Carlos S. Subi},
title = {Distance-Two Colorings of Barnette Graphs},
journal = {CoRR},
volume = {abs/1807.01410},
year = {2018},
url = {http://arxiv.org/abs/1807.01410},
eprinttype = {arXiv},
eprint = {1807.01410},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-01410.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FederHH17,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
C{\'{e}}sar Hern{\'{a}}ndez{-}Cruz},
title = {Colourings, homomorphisms, and partitions of transitive digraphs},
journal = {Eur. J. Comb.},
volume = {60},
pages = {55--65},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2016.09.001},
doi = {10.1016/J.EJC.2016.09.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FederHH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FederH17,
author = {Tom{\'{a}}s Feder and
Pavol Hell},
title = {Correspondence Homomorphisms to Reflexive Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {62},
pages = {9--14},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.10.003},
doi = {10.1016/J.ENDM.2017.10.003},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FederH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RafieyKF17,
author = {Arash Rafiey and
Jeff Kinne and
Tom{\'{a}}s Feder},
title = {Dichotomy for Digraph Homomorphism Problems},
journal = {CoRR},
volume = {abs/1701.02409},
year = {2017},
url = {http://arxiv.org/abs/1701.02409},
eprinttype = {arXiv},
eprint = {1701.02409},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/RafieyKF17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FederH17,
author = {Tom{\'{a}}s Feder and
Pavol Hell},
title = {Complexity of Correspondence Homomorphisms},
journal = {CoRR},
volume = {abs/1703.05881},
year = {2017},
url = {http://arxiv.org/abs/1703.05881},
eprinttype = {arXiv},
eprint = {1703.05881},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FederH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FederHS14,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Oren Shklarsky},
title = {Matrix partitions of split graphs},
journal = {Discret. Appl. Math.},
volume = {166},
pages = {91--96},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.10.016},
doi = {10.1016/J.DAM.2013.10.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FederHS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FederHLST14,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Beno{\^{\i}}t Larose and
Mark H. Siggers and
Claude Tardif},
title = {Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {2},
pages = {817--834},
year = {2014},
url = {https://doi.org/10.1137/130914784},
doi = {10.1137/130914784},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FederHLST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FederS13,
author = {Tom{\'{a}}s Feder and
Carlos S. Subi},
title = {On hypercube labellings and antipodal monochromatic paths},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1421--1426},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.025},
doi = {10.1016/J.DAM.2012.12.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FederS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FederHR13,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Shekoofeh Nekooei Rizi},
title = {Obstructions to partitions of chordal graphs},
journal = {Discret. Math.},
volume = {313},
number = {19},
pages = {1861--1871},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2012.05.023},
doi = {10.1016/J.DISC.2012.05.023},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FederHR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FederS13,
author = {Tom{\'{a}}s Feder and
Carlos S. Subi},
title = {Edge-coloring almost bipartite multigraphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {18},
pages = {685--689},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.06.006},
doi = {10.1016/J.IPL.2013.06.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FederS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FederHLLST13,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Beno{\^{\i}}t Larose and
Cynthia Loten and
Mark H. Siggers and
Claude Tardif},
title = {Graphs Admitting k-NU Operations. Part 1: The Reflexive Case},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {4},
pages = {1940--1963},
year = {2013},
url = {https://doi.org/10.1137/120894312},
doi = {10.1137/120894312},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FederHLLST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FederHS13,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Oren Shklarsky},
title = {Matrix Partitions of Split Graphs},
journal = {CoRR},
volume = {abs/1306.1967},
year = {2013},
url = {http://arxiv.org/abs/1306.1967},
eprinttype = {arXiv},
eprint = {1306.1967},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FederHS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FederHHR12,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Jing Huang and
Arash Rafiey},
title = {Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms},
journal = {Discret. Appl. Math.},
volume = {160},
number = {6},
pages = {697--707},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.04.016},
doi = {10.1016/J.DAM.2011.04.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FederHHR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BodirskyCF12,
author = {Manuel Bodirsky and
Hubie Chen and
Tom{\'{a}}s Feder},
title = {On the Complexity of {MMSNP}},
journal = {{SIAM} J. Discret. Math.},
volume = {26},
number = {1},
pages = {404--414},
year = {2012},
url = {https://doi.org/10.1137/090778493},
doi = {10.1137/090778493},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BodirskyCF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tdp/GanapathyTFGM12,
author = {Vignesh Ganapathy and
Dilys Thomas and
Tom{\'{a}}s Feder and
Hector Garcia{-}Molina and
Rajeev Motwani},
title = {Distributing Data for Secure Database Services},
journal = {Trans. Data Priv.},
volume = {5},
number = {1},
pages = {253--272},
year = {2012},
url = {http://www.tdp.cat/issues11/abs.a089a11.php},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tdp/GanapathyTFGM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FederS12,
author = {Tom{\'{a}}s Feder and
Carlos S. Subi},
title = {Packing Edge-Disjoint Triangles in Given Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-013}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/013},
eprinttype = {ECCC},
eprint = {TR12-013},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FederS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FederHSS11,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
David G. Schell and
Juraj Stacho},
title = {Dichotomy for tree-structured trigraph list homomorphism problems},
journal = {Discret. Appl. Math.},
volume = {159},
number = {12},
pages = {1217--1224},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.04.005},
doi = {10.1016/J.DAM.2011.04.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FederHSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FederHR11,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Shekoofeh Nekooei Rizi},
title = {Partitioning Chordal Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {38},
pages = {325--330},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.09.053},
doi = {10.1016/J.ENDM.2011.09.053},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FederHR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FederS11,
author = {Tom{\'{a}}s Feder and
Carlos S. Subi},
title = {Maximum gap labelings of graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {4},
pages = {169--173},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.010},
doi = {10.1016/J.IPL.2010.11.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FederS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/edbt/GanapathyTFGM11,
author = {Vignesh Ganapathy and
Dilys Thomas and
Tom{\'{a}}s Feder and
Hector Garcia{-}Molina and
Rajeev Motwani},
editor = {Traian Marius Truta and
Li Xiong and
Farshad Fotouhi and
Kjell Orsborn and
Silvia Stefanova},
title = {Distributing data for secure database services},
booktitle = {Proceedings of the 2011 International Workshop on Privacy and Anonymity
in Information Society, {PAIS} 2011, Uppsala, Sweden, March 2011},
pages = {8},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1971690.1971698},
doi = {10.1145/1971690.1971698},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/edbt/GanapathyTFGM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FederM10,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani},
title = {Finding large cycles in Hamiltonian graphs},
journal = {Discret. Appl. Math.},
volume = {158},
number = {8},
pages = {882--893},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2009.12.006},
doi = {10.1016/J.DAM.2009.12.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FederM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FederHJKN10,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Peter Jonsson and
Andrei A. Krokhin and
Gustav Nordh},
title = {Retractions to Pseudoforests},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {1},
pages = {101--112},
year = {2010},
url = {https://doi.org/10.1137/080738866},
doi = {10.1137/080738866},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FederHJKN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AggarwalPFTKKZ10,
author = {Gagan Aggarwal and
Rina Panigrahy and
Tom{\'{a}}s Feder and
Dilys Thomas and
Krishnaram Kenthapadi and
Samir Khuller and
An Zhu},
title = {Achieving anonymity via clustering},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {3},
pages = {49:1--49:19},
year = {2010},
url = {https://doi.org/10.1145/1798596.1798602},
doi = {10.1145/1798596.1798602},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/AggarwalPFTKKZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-0358,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
David G. Schell and
Juraj Stacho},
title = {Dichotomy for tree-structured trigraph list homomorphism problems},
journal = {CoRR},
volume = {abs/1009.0358},
year = {2010},
url = {http://arxiv.org/abs/1009.0358},
eprinttype = {arXiv},
eprint = {1009.0358},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-0358.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FederHH09,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Jing Huang},
title = {Extension problems with degree bounds},
journal = {Discret. Appl. Math.},
volume = {157},
number = {7},
pages = {1592--1599},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.04.006},
doi = {10.1016/J.DAM.2008.04.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FederHH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FederHHR09,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Jing Huang and
Arash Rafiey},
title = {Adjusted Interval Digraphs},
journal = {Electron. Notes Discret. Math.},
volume = {32},
pages = {83--91},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.02.012},
doi = {10.1016/J.ENDM.2009.02.012},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FederHHR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FederS09,
author = {Tom{\'{a}}s Feder and
Carlos S. Subi},
title = {Nearly tight bounds on the number of Hamiltonian circuits of the hypercube
and generalizations},
journal = {Inf. Process. Lett.},
volume = {109},
number = {5},
pages = {267--272},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2008.10.015},
doi = {10.1016/J.IPL.2008.10.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FederS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FederM09,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani},
title = {On the graph turnpike problem},
journal = {Inf. Process. Lett.},
volume = {109},
number = {14},
pages = {774--776},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.03.024},
doi = {10.1016/J.IPL.2009.03.024},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FederM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FederMT09,
author = {Tom{\'{a}}s Feder and
Heikki Mannila and
Evimaria Terzi},
title = {Approximating the Minimum Chain Completion problem},
journal = {Inf. Process. Lett.},
volume = {109},
number = {17},
pages = {980--985},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.05.006},
doi = {10.1016/J.IPL.2009.05.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FederMT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FederH08,
author = {Tom{\'{a}}s Feder and
Pavol Hell},
title = {On realizations of point determining graphs, and obstructions to full
homomorphisms},
journal = {Discret. Math.},
volume = {308},
number = {9},
pages = {1639--1652},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2006.11.026},
doi = {10.1016/J.DISC.2006.11.026},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FederH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FederHH08,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Jing Huang},
title = {Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {1},
pages = {1--14},
year = {2008},
url = {https://doi.org/10.1137/06066000X},
doi = {10.1137/06066000X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FederHH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrewsterFHHM08,
author = {Richard C. Brewster and
Tom{\'{a}}s Feder and
Pavol Hell and
Jing Huang and
Gary MacGillivray},
title = {Near-Unanimity Functions and Varieties of Reflexive Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {3},
pages = {938--960},
year = {2008},
url = {https://doi.org/10.1137/S0895480103436748},
doi = {10.1137/S0895480103436748},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrewsterFHHM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0810-5578,
author = {Tom{\'{a}}s Feder and
Shubha U. Nabar and
Evimaria Terzi},
title = {Anonymizing Graphs},
journal = {CoRR},
volume = {abs/0810.5578},
year = {2008},
url = {http://arxiv.org/abs/0810.5578},
eprinttype = {arXiv},
eprint = {0810.5578},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0810-5578.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FederS08,
author = {Tom{\'{a}}s Feder and
Carlos S. Subi},
title = {Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube
and Generalizations (revised)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-087}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-087/index.html},
eprinttype = {ECCC},
eprint = {TR08-087},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FederS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/FederHX07,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Wing Xie},
title = {Matrix Partitions with Finitely Many Obstructions},
journal = {Electron. J. Comb.},
volume = {14},
number = {1},
year = {2007},
url = {https://doi.org/10.37236/976},
doi = {10.37236/976},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/FederHX07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FederHH07,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Jing Huang},
title = {List homomorphisms of graphs with bounded degrees},
journal = {Discret. Math.},
volume = {307},
number = {3-5},
pages = {386--392},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.09.030},
doi = {10.1016/J.DISC.2005.09.030},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FederHH07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FederHH07a,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Jing Huang},
title = {The structure of bi-arc trees},
journal = {Discret. Math.},
volume = {307},
number = {3-5},
pages = {393--401},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.09.031},
doi = {10.1016/J.DISC.2005.09.031},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FederHH07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FederHX07,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Wing Xie},
title = {Matrix Partitions with Finitely Many Obstructions},
journal = {Electron. Notes Discret. Math.},
volume = {28},
pages = {371--378},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.01.057},
doi = {10.1016/J.ENDM.2007.01.057},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FederHX07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FederMOOP07,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani and
Liadan O'Callaghan and
Chris Olston and
Rina Panigrahy},
title = {Computing shortest paths with uncertainty},
journal = {J. Algorithms},
volume = {62},
number = {1},
pages = {1--18},
year = {2007},
url = {https://doi.org/10.1016/j.jalgor.2004.07.005},
doi = {10.1016/J.JALGOR.2004.07.005},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/FederMOOP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CarmoFKLMOPT07,
author = {Renato Carmo and
Tom{\'{a}}s Feder and
Yoshiharu Kohayakawa and
Eduardo Sany Laber and
Rajeev Motwani and
Liadan O'Callaghan and
Rina Panigrahy and
Dilys Thomas},
title = {Querying priced information in databases: The conjunctive case},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {1},
pages = {9:1--9:22},
year = {2007},
url = {https://doi.org/10.1145/1219944.1219955},
doi = {10.1145/1219944.1219955},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/CarmoFKLMOPT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/FederNS07,
author = {Tom{\'{a}}s Feder and
Hamid Nazerzadeh and
Amin Saberi},
editor = {Jeffrey K. MacKie{-}Mason and
David C. Parkes and
Paul Resnick},
title = {Approximating nash equilibria using small-support strategies},
booktitle = {Proceedings 8th {ACM} Conference on Electronic Commerce (EC-2007),
San Diego, California, USA, June 11-15, 2007},
pages = {352--354},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250910.1250961},
doi = {10.1145/1250910.1250961},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/FederNS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FederS07,
author = {Tom{\'{a}}s Feder and
Carlos S. Subi},
title = {Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube
and Generalizations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-063}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-063/index.html},
eprinttype = {ECCC},
eprint = {TR07-063},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FederS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FederHT06,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Kim Tucker{-}Nally},
title = {Digraph matrix partitions and trigraph homomorphisms},
journal = {Discret. Appl. Math.},
volume = {154},
number = {17},
pages = {2458--2469},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2006.02.009},
doi = {10.1016/J.DAM.2006.02.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FederHT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FederH06,
author = {Tom{\'{a}}s Feder and
Pavol Hell},
title = {Matrix partitions of perfect graphs},
journal = {Discret. Math.},
volume = {306},
number = {19-20},
pages = {2450--2460},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2005.12.035},
doi = {10.1016/J.DISC.2005.12.035},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FederH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FederH06,
author = {Tom{\'{a}}s Feder and
Pavol Hell},
title = {Full Constraint Satisfaction Problems},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {1},
pages = {230--246},
year = {2006},
url = {https://doi.org/10.1137/S0097539703427197},
doi = {10.1137/S0097539703427197},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FederH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Feder06,
author = {Tom{\'{a}}s Feder},
title = {A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings},
journal = {{SIAM} J. Discret. Math.},
volume = {20},
number = {2},
pages = {291--301},
year = {2006},
url = {https://doi.org/10.1137/S0895480103427734},
doi = {10.1137/S0895480103427734},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Feder06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FederF06,
author = {Tom{\'{a}}s Feder and
Daniel K. Ford},
title = {Classification of Bipartite Boolean Constraint Satisfaction through
Delta-Matroid Intersection},
journal = {{SIAM} J. Discret. Math.},
volume = {20},
number = {2},
pages = {372--394},
year = {2006},
url = {https://doi.org/10.1137/S0895480104445009},
doi = {10.1137/S0895480104445009},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FederF06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FederGMS06,
author = {Tom{\'{a}}s Feder and
Adam Guetz and
Milena Mihail and
Amin Saberi},
title = {A Local Switch Markov Chain on Given Degree Graphs with Application
in Connectivity of Peer-to-Peer Networks},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {69--76},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.5},
doi = {10.1109/FOCS.2006.5},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FederGMS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/AggarwalFKKPTZ06,
author = {Gagan Aggarwal and
Tom{\'{a}}s Feder and
Krishnaram Kenthapadi and
Samir Khuller and
Rina Panigrahy and
Dilys Thomas and
An Zhu},
editor = {Stijn Vansummeren},
title = {Achieving anonymity via clustering},
booktitle = {Proceedings of the Twenty-Fifth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois,
{USA}},
pages = {153--162},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1142351.1142374},
doi = {10.1145/1142351.1142374},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/AggarwalFKKPTZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR06-015,
author = {Tom{\'{a}}s Feder and
Carlos S. Subi},
title = {On Barnette's conjecture},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-015}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-015/index.html},
eprinttype = {ECCC},
eprint = {TR06-015},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR06-015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR06-016,
author = {Tom{\'{a}}s Feder and
Carlos S. Subi},
title = {Partition into k-vertex subgraphs of k-partite graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-016}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-016/index.html},
eprinttype = {ECCC},
eprint = {TR06-016},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR06-016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Feder06,
author = {Tom{\'{a}}s Feder},
title = {Constraint satisfaction: a personal perspective},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-021}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-021/index.html},
eprinttype = {ECCC},
eprint = {TR06-021},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Feder06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FederAMZ06,
author = {Tom{\'{a}}s Feder and
Gagan Aggarwal and
Rajeev Motwani and
An Zhu},
title = {Channel assignment in wireless networks and classification of minimum
graph homomorphism},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-040}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-040/index.html},
eprinttype = {ECCC},
eprint = {TR06-040},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FederAMZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FederK06,
author = {Tom{\'{a}}s Feder and
Phokion G. Kolaitis},
title = {Closures and dichotomies for quantified constraints},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-160}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-160/index.html},
eprinttype = {ECCC},
eprint = {TR06-160},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FederK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FederM06,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani},
title = {Finding large cycles in Hamiltonian graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-156}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-156/index.html},
eprinttype = {ECCC},
eprint = {TR06-156},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FederM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FederMZ06,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani and
An Zhu},
title = {k-connected spanning subgraphs of low degree},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-041}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-041/index.html},
eprinttype = {ECCC},
eprint = {TR06-041},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FederMZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FederS05,
author = {Tom{\'{a}}s Feder and
Carlos S. Subi},
title = {Disks on a Tree: Analysis of a Combinatorial Game},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {543--552},
year = {2005},
url = {https://doi.org/10.1137/S0895480102418002},
doi = {10.1137/S0895480102418002},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FederS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FederHKNP05,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Sulamita Klein and
Loana Tito Nogueira and
F{\'{a}}bio Protti},
title = {List matrix partitions of chordal graphs},
journal = {Theor. Comput. Sci.},
volume = {349},
number = {1},
pages = {52--66},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.09.030},
doi = {10.1016/J.TCS.2005.09.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FederHKNP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/AggarwalFMPZ05,
author = {Gagan Aggarwal and
Tom{\'{a}}s Feder and
Rajeev Motwani and
Rina Panigrahy and
An Zhu},
editor = {Thomas Eiter and
Leonid Libkin},
title = {Algorithms for the Database Layout Problem},
booktitle = {Database Theory - {ICDT} 2005, 10th International Conference, Edinburgh,
UK, January 5-7, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3363},
pages = {189--203},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-30570-5\_13},
doi = {10.1007/978-3-540-30570-5\_13},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdt/AggarwalFMPZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/AggarwalFKMPTZ05,
author = {Gagan Aggarwal and
Tom{\'{a}}s Feder and
Krishnaram Kenthapadi and
Rajeev Motwani and
Rina Panigrahy and
Dilys Thomas and
An Zhu},
editor = {Thomas Eiter and
Leonid Libkin},
title = {Anonymizing Tables},
booktitle = {Database Theory - {ICDT} 2005, 10th International Conference, Edinburgh,
UK, January 5-7, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3363},
pages = {246--258},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-30570-5\_17},
doi = {10.1007/978-3-540-30570-5\_17},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdt/AggarwalFKMPTZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FederM05,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani},
title = {Finding large cycles in Hamiltonian graphs},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {166--175},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070456},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/FederM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FederHKS05,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Daniel Kr{\'{a}}l and
Jir{\'{\i}} Sgall},
title = {Two algorithms for general list matrix partitions},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {870--876},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070554},
timestamp = {Wed, 11 Nov 2015 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/FederHKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-005,
author = {Tom{\'{a}}s Feder},
title = {Constraint Satisfaction on Finite Groups with Near Subgroups},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-005}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-005/index.html},
eprinttype = {ECCC},
eprint = {TR05-005},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-016,
author = {Tom{\'{a}}s Feder and
Daniel K. Ford},
title = {Classification of Bipartite Boolean Constraint Satisfaction through
Delta-Matroid Intersection},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-016}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-016/index.html},
eprinttype = {ECCC},
eprint = {TR05-016},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CharikarCFM04,
author = {Moses Charikar and
Chandra Chekuri and
Tom{\'{a}}s Feder and
Rajeev Motwani},
title = {Incremental Clustering and Dynamic Information Retrieval},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {6},
pages = {1417--1440},
year = {2004},
url = {https://doi.org/10.1137/S0097539702418498},
doi = {10.1137/S0097539702418498},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/CharikarCFM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FederMS04,
author = {Tom{\'{a}}s Feder and
Florent R. Madelaine and
Iain A. Stewart},
title = {Dichotomies for classes of homomorphism problems involving unary functions},
journal = {Theor. Comput. Sci.},
volume = {314},
number = {1-2},
pages = {1--43},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2003.12.015},
doi = {10.1016/J.TCS.2003.12.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FederMS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FederMPSSZ04,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani and
Rina Panigrahy and
Steven S. Seiden and
Rob van Stee and
An Zhu},
title = {Combining request scheduling with web caching},
journal = {Theor. Comput. Sci.},
volume = {324},
number = {2-3},
pages = {201--218},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2004.05.016},
doi = {10.1016/J.TCS.2004.05.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FederMPSSZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AggarwalFMZ04,
author = {Gagan Aggarwal and
Tom{\'{a}}s Feder and
Rajeev Motwani and
An Zhu},
editor = {Josep D{\'{\i}}az and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Donald Sannella},
title = {Algorithms for Multi-product Pricing},
booktitle = {Automata, Languages and Programming: 31st International Colloquium,
{ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3142},
pages = {72--83},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27836-8\_9},
doi = {10.1007/978-3-540-27836-8\_9},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AggarwalFMZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/FederHKNP04,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Sulamita Klein and
Loana Tito Nogueira and
F{\'{a}}bio Protti},
editor = {Martin Farach{-}Colton},
title = {List Partitions of Chordal Graphs},
booktitle = {{LATIN} 2004: Theoretical Informatics, 6th Latin American Symposium,
Buenos Aires, Argentina, April 5-8, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2976},
pages = {100--108},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24698-5\_14},
doi = {10.1007/978-3-540-24698-5\_14},
timestamp = {Fri, 09 Apr 2021 18:42:35 +0200},
biburl = {https://dblp.org/rec/conf/latin/FederHKNP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DatarFGMP03,
author = {Mayur Datar and
Tom{\'{a}}s Feder and
Aristides Gionis and
Rajeev Motwani and
Rina Panigrahy},
title = {A combinatorial algorithm for {MAX} {CSP}},
journal = {Inf. Process. Lett.},
volume = {85},
number = {6},
pages = {307--315},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00435-0},
doi = {10.1016/S0020-0190(02)00435-0},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DatarFGMP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FederHH03,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Jing Huang},
title = {Bi-arc graphs and the complexity of list homomorphisms},
journal = {J. Graph Theory},
volume = {42},
number = {1},
pages = {61--80},
year = {2003},
url = {https://doi.org/10.1002/jgt.10073},
doi = {10.1002/JGT.10073},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FederHH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FederMPOW03,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani and
Rina Panigrahy and
Chris Olston and
Jennifer Widom},
title = {Computing the Median with Uncertainty},
journal = {{SIAM} J. Comput.},
volume = {32},
number = {2},
pages = {538--547},
year = {2003},
url = {https://doi.org/10.1137/S0097539701395668},
doi = {10.1137/S0097539701395668},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FederMPOW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FederHKM03,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Sulamita Klein and
Rajeev Motwani},
title = {List Partitions},
journal = {{SIAM} J. Discret. Math.},
volume = {16},
number = {3},
pages = {449--478},
year = {2003},
url = {https://doi.org/10.1137/S0895480100384055},
doi = {10.1137/S0895480100384055},
timestamp = {Sat, 31 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FederHKM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FederHM03,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Bojan Mohar},
title = {Acyclic Homomorphisms and Circular Colorings of Digraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {17},
number = {1},
pages = {161--169},
year = {2003},
url = {https://doi.org/10.1137/S0895480103422184},
doi = {10.1137/S0895480103422184},
timestamp = {Fri, 23 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FederHM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/FederV03,
author = {Tom{\'{a}}s Feder and
Moshe Y. Vardi},
title = {Homomorphism Closed vs. Existential Positive},
booktitle = {18th {IEEE} Symposium on Logic in Computer Science {(LICS} 2003),
22-25 June 2003, Ottawa, Canada, Proceedings},
pages = {311--320},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/LICS.2003.1210071},
doi = {10.1109/LICS.2003.1210071},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/FederV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FederMMOP03,
author = {Tom{\'{a}}s Feder and
Adam Meyerson and
Rajeev Motwani and
Liadan O'Callaghan and
Rina Panigrahy},
editor = {Helmut Alt and
Michel Habib},
title = {Representing Graph Metrics with Fewest Edges},
booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
pages = {355--366},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_32},
doi = {10.1007/3-540-36494-3\_32},
timestamp = {Thu, 14 Oct 2021 10:38:16 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FederMMOP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FederMOOP03,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani and
Liadan O'Callaghan and
Chris Olston and
Rina Panigrahy},
editor = {Helmut Alt and
Michel Habib},
title = {Computing Shortest Paths with Uncertainty},
booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
pages = {367--378},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_33},
doi = {10.1007/3-540-36494-3\_33},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/FederMOOP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FederM02,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani},
title = {Worst-case time bounds for coloring and satisfiability problems},
journal = {J. Algorithms},
volume = {45},
number = {2},
pages = {192--201},
year = {2002},
url = {https://doi.org/10.1016/S0196-6774(02)00224-9},
doi = {10.1016/S0196-6774(02)00224-9},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/FederM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FederMS02,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani and
Carlos S. Subi},
title = {Approximating the Longest Cycle Problem in Sparse Graphs},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {5},
pages = {1596--1607},
year = {2002},
url = {https://doi.org/10.1137/S0097539701395486},
doi = {10.1137/S0097539701395486},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FederMS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FederMPZ02,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani and
Rina Panigrahy and
An Zhu},
editor = {David Eppstein},
title = {Web caching with request reordering},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {104--105},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545393},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/FederMPZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Feder01,
author = {Tom{\'{a}}s Feder},
title = {Classification of Homomorphisms to Oriented Cycles and of k-Partite
Satisfiability},
journal = {{SIAM} J. Discret. Math.},
volume = {14},
number = {4},
pages = {471--480},
year = {2001},
url = {https://doi.org/10.1137/S0895480199383353},
doi = {10.1137/S0895480199383353},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Feder01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Feder01,
author = {Tom{\'{a}}s Feder},
title = {Fanout limitations on constraint systems},
journal = {Theor. Comput. Sci.},
volume = {255},
number = {1-2},
pages = {281--293},
year = {2001},
url = {https://doi.org/10.1016/S0304-3975(99)00288-1},
doi = {10.1016/S0304-3975(99)00288-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Feder01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FederMP00,
author = {Tom{\'{a}}s Feder and
Nimrod Megiddo and
Serge A. Plotkin},
title = {A sublinear parallel algorithm for stable matching},
journal = {Theor. Comput. Sci.},
volume = {233},
number = {1-2},
pages = {297--308},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00125-5},
doi = {10.1016/S0304-3975(99)00125-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FederMP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FederMS00,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani and
Carlos S. Subi},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Finding long paths and cycles in sparse Hamiltonian graphs},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {524--529},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335368},
doi = {10.1145/335305.335368},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FederMS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FederMPOW00,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani and
Rina Panigrahy and
Chris Olston and
Jennifer Widom},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Computing the median with uncertainty},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {602--607},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335386},
doi = {10.1145/335305.335386},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FederMPOW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FederHH99,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Jing Huang},
title = {List Homomorphisms and Circular Arc Graphs},
journal = {Comb.},
volume = {19},
number = {4},
pages = {487--505},
year = {1999},
url = {https://doi.org/10.1007/s004939970003},
doi = {10.1007/S004939970003},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FederHH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FederHKM99,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Sulamita Klein and
Rajeev Motwani},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Complexity of Graph Partition Problems},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {464--472},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301373},
doi = {10.1145/301250.301373},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FederHKM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FederS98,
author = {Tom{\'{a}}s Feder and
Sunil M. Shende},
title = {Online Channel Allocation in {FDMA} Networks with Reuse Constraints},
journal = {Inf. Process. Lett.},
volume = {67},
number = {6},
pages = {295--302},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00126-4},
doi = {10.1016/S0020-0190(98)00126-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FederS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FederH98,
author = {Tom{\'{a}}s Feder and
Pavol Hell},
title = {List Homomorphisms to Reflexive Graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {72},
number = {2},
pages = {236--250},
year = {1998},
url = {https://doi.org/10.1006/jctb.1997.1812},
doi = {10.1006/JCTB.1997.1812},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FederH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FederV98,
author = {Tom{\'{a}}s Feder and
Moshe Y. Vardi},
title = {The Computational Structure of Monotone Monadic {SNP} and Constraint
Satisfaction: {A} Study through Datalog and Group Theory},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {1},
pages = {57--104},
year = {1998},
url = {https://doi.org/10.1137/S0097539794266766},
doi = {10.1137/S0097539794266766},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FederV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CharikarCFM97,
author = {Moses Charikar and
Chandra Chekuri and
Tom{\'{a}}s Feder and
Rajeev Motwani},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {Incremental Clustering and Dynamic Information Retrieval},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {626--635},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258657},
doi = {10.1145/258533.258657},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CharikarCFM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlurFH96,
author = {Rajeev Alur and
Tom{\'{a}}s Feder and
Thomas A. Henzinger},
title = {The Benefits of Relaxing Punctuality},
journal = {J. {ACM}},
volume = {43},
number = {1},
pages = {116--146},
year = {1996},
url = {https://doi.org/10.1145/227595.227602},
doi = {10.1145/227595.227602},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AlurFH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FederM95,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani},
title = {Clique Partitions, Graph Compression and Speeding-Up Algorithms},
journal = {J. Comput. Syst. Sci.},
volume = {51},
number = {2},
pages = {261--272},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1065},
doi = {10.1006/JCSS.1995.1065},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FederM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FederKNN95,
author = {Tom{\'{a}}s Feder and
Eyal Kushilevitz and
Moni Naor and
Noam Nisan},
title = {Amortized Communication Complexity},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {736--750},
year = {1995},
url = {https://doi.org/10.1137/S0097539792235864},
doi = {10.1137/S0097539792235864},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FederKNN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Feder94,
author = {Tom{\'{a}}s Feder},
title = {Network Flow and 2-Satisfiability},
journal = {Algorithmica},
volume = {11},
number = {3},
pages = {291--319},
year = {1994},
url = {https://doi.org/10.1007/BF01240738},
doi = {10.1007/BF01240738},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Feder94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FederMP94,
author = {Tom{\'{a}}s Feder and
Nimrod Megiddo and
Serge A. Plotkin},
editor = {Daniel Dominic Sleator},
title = {A Sublinear Parallel Algorithm for Stable Matching},
booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
23-25 January 1994, Arlington, Virginia, {USA}},
pages = {632--637},
publisher = {{ACM/SIAM}},
year = {1994},
url = {http://dl.acm.org/citation.cfm?id=314464.314664},
timestamp = {Thu, 05 Jul 2018 07:29:19 +0200},
biburl = {https://dblp.org/rec/conf/soda/FederMP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FederV93,
author = {Tom{\'{a}}s Feder and
Moshe Y. Vardi},
editor = {S. Rao Kosaraju and
David S. Johnson and
Alok Aggarwal},
title = {Monotone monadic {SNP} and constraint satisfaction},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
Computing, May 16-18, 1993, San Diego, CA, {USA}},
pages = {612--622},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/167088.167245},
doi = {10.1145/167088.167245},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FederV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Feder92,
author = {Tom{\'{a}}s Feder},
title = {A New Fixed Point Approach for Stable Networks and Stable Marriages},
journal = {J. Comput. Syst. Sci.},
volume = {45},
number = {2},
pages = {233--284},
year = {1992},
url = {https://doi.org/10.1016/0022-0000(92)90048-N},
doi = {10.1016/0022-0000(92)90048-N},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Feder92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Feder92,
author = {Tom{\'{a}}s Feder},
title = {Product graph representations},
journal = {J. Graph Theory},
volume = {16},
number = {5},
pages = {467--488},
year = {1992},
url = {https://doi.org/10.1002/jgt.3190160508},
doi = {10.1002/JGT.3190160508},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Feder92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DolevF92,
author = {Danny Dolev and
Tom{\'{a}}s Feder},
title = {Determinism vs. Nondeterminism in Multiparty Communication Complexity},
journal = {{SIAM} J. Comput.},
volume = {21},
number = {5},
pages = {889--895},
year = {1992},
url = {https://doi.org/10.1137/0221052},
doi = {10.1137/0221052},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DolevF92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/FederS92,
author = {Tom{\'{a}}s Feder and
Yatin P. Saraiya},
editor = {Joachim Biskup and
Richard Hull},
title = {Decidability and Undecidability of Equivalence for Linear Datalog
with Applications to Normal-Form Optimizations},
booktitle = {Database Theory - ICDT'92, 4th International Conference, Berlin, Germany,
October 14-16, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {646},
pages = {297--311},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56039-4\_49},
doi = {10.1007/3-540-56039-4\_49},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icdt/FederS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FederM92,
author = {Tom{\'{a}}s Feder and
Milena Mihail},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {Balanced Matroids},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {26--38},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129716},
doi = {10.1145/129712.129716},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FederM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Feder91,
author = {Tom{\'{a}}s Feder},
title = {Stable networks and product graphs},
school = {Stanford University, {USA}},
year = {1991},
url = {https://searchworks.stanford.edu/view/2048002},
timestamp = {Wed, 31 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Feder91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FederKN91,
author = {Tom{\'{a}}s Feder and
Eyal Kushilevitz and
Moni Naor},
title = {Amortized Communication Complexity (Preliminary Version)},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {239--248},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185374},
doi = {10.1109/SFCS.1991.185374},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FederKN91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AlurFH91,
author = {Rajeev Alur and
Tom{\'{a}}s Feder and
Thomas A. Henzinger},
editor = {Luigi Logrippo},
title = {The Benefits of Relaxing Punctuality},
booktitle = {Proceedings of the Tenth Annual {ACM} Symposium on Principles of Distributed
Computing, Montreal, Quebec, Canada, August 19-21, 1991},
pages = {139--152},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/112600.112613},
doi = {10.1145/112600.112613},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/AlurFH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FederM91,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani},
editor = {Cris Koutsougeras and
Jeffrey Scott Vitter},
title = {Clique Partitions, Graph Compression, and Speeding-Up Algorithms},
booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
May 5-8, 1991, New Orleans, Louisiana, {USA}},
pages = {123--133},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/103418.103424},
doi = {10.1145/103418.103424},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FederM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Feder89,
author = {Tom{\'{a}}s Feder},
title = {Reliable computation by networks in the presence of noise},
journal = {{IEEE} Trans. Inf. Theory},
volume = {35},
number = {3},
pages = {569--571},
year = {1989},
url = {https://doi.org/10.1109/18.30978},
doi = {10.1109/18.30978},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Feder89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DolevF89,
author = {Danny Dolev and
Tom{\'{a}}s Feder},
title = {Multiparty Communication Complexity},
booktitle = {30th Annual Symposium on Foundations of Computer Science, Research
Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
pages = {428--433},
publisher = {{IEEE} Computer Society},
year = {1989},
url = {https://doi.org/10.1109/SFCS.1989.63514},
doi = {10.1109/SFCS.1989.63514},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DolevF89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Feder89,
author = {Tom{\'{a}}s Feder},
editor = {David S. Johnson},
title = {A New Fixed Point Approach for Stable Networks and Stable Marriages},
booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
May 14-17, 1989, Seattle, Washington, {USA}},
pages = {513--522},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/73007.73056},
doi = {10.1145/73007.73056},
timestamp = {Wed, 24 Nov 2021 12:15:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Feder89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FederG88,
author = {Tom{\'{a}}s Feder and
Daniel H. Greene},
editor = {Janos Simon},
title = {Optimal Algorithms for Approximate Clustering},
booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing,
May 2-4, 1988, Chicago, Illinois, {USA}},
pages = {434--444},
publisher = {{ACM}},
year = {1988},
url = {https://doi.org/10.1145/62212.62255},
doi = {10.1145/62212.62255},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FederG88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-03 00:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
