Some papers and books citing some results of Mihaly Hujter
<BR>(Last modification: May 10, 2012)

<BR> <BR> <BR> Year 2012
<BR>

<BR> This paper by Aouchiche and Hansen cites the DM115 paper:
<A 
href="http://www.sciencedirect.com/science/article/pii/S0166218X11005075">
A survey of ...</A>
, To appear in Discrete Math.
 
<BR> This paper by Ilinca and Kahn cites the SIAM paper:
<A href="http://arxiv.org/pdf/1202.4427.pdf">
Counting maximal ...</A>

<BR> This paper by Ortiz and Villanueva cites the SIAM paper:
<A 
href="http://www.sciencedirect.com/science/article/pii/S0166218X11003994">
Maximal independent ...</A>
, Published in Discrete Appl. Math., Vol 160. 






<BR> <BR> <BR> Year 2011 
<BR>

<BR>This review by Cipu cites the CEJOR paper:
<A href="http://math.bme.hu/~hujter/MR2593122.gif">
MR2593122</A>
, Published in Mathematical Reviews, Vol. 2011b.

<BR>This paper by Enright and Stewart cites the PrExt3 paper: 
<A href="http://arxiv.org/PS_cache/arxiv/pdf/1104/1104.5009v2.pdf">
3-List colouring ...</A>
, To appear.

<BR>This paper by Fellows, Friedrich, Hermelin, Narodytska and Rosamond cites the PrExt1 paper: 
<A href="http://www.mpi-inf.mpg.de/~hermelin/Conference%20Publications/CSP.pdf">
Constraint satisfaction ...</A>
, To appear in IJCAI.

<BR>This paper by Fiala, Jansen and Kratsch cites Precoloring Extension: 
<A href="http://www.sciencedirect.com/science/article/pii/S0304397510006055">
Parametrized complexity ...</A>
, Published in Theor. Comput. Sci., Vol. 412. 

<BR>This paper by Galinier, Hertz and Paroz cites PrExt1:
<A href="http://www.springerlink.com/content/b281t2047p455323/fulltext.pdf">
Using local search ...</A>
, Published in Ann. Oper. Res., Vol. 184.

<BR>This M.Sc. thesis, written in Magyar, by Halasz cites supervising:
<A href="http://www.math.bme.hu/~hujter/halasz.pdf">
Grafszinezesek a ...</A>
, defended at Techn. Univ., Budapest.

<BR>This paper by Jansen and Kratsch cites Precoloring Extension: 
<A href="http://arxiv.org/PS_cache/arxiv/pdf/1104/1104.4229v1.pdf">
Data reduction for ...</A>
, To appear somewhere. 

<BR>This paper by Jin, Zhu and Liang cites the Farber and SIAM papers: 
<A href="http://www.m-hikari.com/forth2/jinIJCMS21-24-2011.pdf">
Maximal independent ...</A>
, Published in Int. J. Contemp. Math. Sci., Vol 6.

<BR>This paper by Jou cites the SIAM paper: 
<A href="http://www.springerlink.com/content/84067175u948x8gj/">
The second largest ...</A>
, To appear in J. Combin. Optim.

<BR>This paper by Harold W. Kuhn cites the KE paper and private 
communication: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
A tale of three  ...</A>
, To appear in EJOR.

<BR>This thesis, written in French, by Morel cites the Farber paper:
<A href="...">
Stabilite et coloration ...</A>
, Defended at Univ. de Grenoble, France.

<BR>This paper by Omi cites the PrExt papers: 
<A href="http://jsb.cs.uec.ac.jp/~manabe/abstract3/omi.pdf">
Precoloring extension ...</A>
, To appear.

<BR>This paper by Szalkai and Szalkai cites the SIMPLEX manuscript: 
<A href="http://www.springerlink.com/content/r4w8879l7j558277/fulltext.pdf">
On the definition ...</A>
, To appear in J. Math. Chemistry. 

<BR>This M.Sc. thesis, written in Magyar, by Szeidl cites supervising:
<A href="http://www.math.bme.hu/~hujter/szeidl.pdf">
Egybevago ...</A>
, to be defended at Techn. Univ., Budapest.

<BR>This webpage by Weisstein cites the Ramanujan paper:
<A href="http://mathworld.wolfram.com/PostageStampProblem.html">
Postage stamp ...</A>
, Published at Wolfram Math World









<BR> <BR> <BR> Year 2010
<BR>

<BR>This long survey by Aouchiche and Hansen cites the DM115 paper: 
<A href="http://www.gerad.ca/es/publicaciones/cahiers_chrono.php?annee=2010&resumes=0">A survey of Nordhauss-Gaddum ...</A>
, Published at Les Cahiers du GERAD, Vol. G-2010-74.

<BR>This paper by Axenovich, Hutchinson and Lastrina cites precoloring extension: 
<A href="http://arxiv.org/abs/1006.5596">List precoloring extension...</A>

<BR>This paper by Bonomo, Faenza and Oriolo cites the PrExt1,PrExt2,PrExt3 papers: 
<A href="http://art.torvergata.it/bitstream/2108/7960/1/TR14.pdf">
On coloring problems ...</A>
, submitted to Elsevier. 

<BR>This paper by Brisk, Verma and Ienne cites the PrExt1 paper: 
<A href="http://lap.epfl.ch/webdav/site/lap/shared/publications/BriskJul10_AnOptimalLinearTimeAlgorithmForInterproceduralRegisterAllocationInHighLevelSynthesisUsingSsaForm_IEETCAD.pdf">
An optimal linear-time algorithm for ...</A>
, Published in IEEE Transactions on Computer-Aided ..., Vol. 29.

<BR>This paper by Bu, Liang and Liu cites the SIAM paper:
<A href="http://qks.zjnu.net.cn/upfile/soft/2010427/2010427164451722.pdf">
Counting the maximal ...</A>
, Published in J. Zheijang Normal University, Vol. 33.  

<BR>This paper by Choudum and Karthick cites the DM115 paper: 
<A href="http://www.math.bme.hu/~hujter/choudu10.pdf">Maximal cliques in ...</A>
, Published in Discrete Math., Vol. 310. 

<BR>This paper by Csendes, Galantai and Szeidl cites the CEJOR paper:
<A href="http://www.springerlink.com/content/ex7w01471v645pt2/">
Special issue ...</A>
, Published in Central Eur. J. Oper. Res., Vol. 18. 

<BR>This paper by Dall'Asta, Pin, and Ramezanpour cites the SIAM paper: 
<A href="http://arxiv.org/PS_cache/arxiv/pdf/0907/0907.3309v2.pdf">
Statistical mechanism ...</A>
, Published in Phys. Rev. E.

<BR>This paper by Dereniowski and Kubiak cites the PrExt1 paper: 
<A href="http://www.springerlink.com/content/r84304867803v87n/fulltext.pdf">
Makespan minimization ...</A>
, Published in J. Scheduling, Vol. 13. 

<BR>This paper by Elango, Shirinivas and Vetrivel cites Precoloring Extension:
<A href="http://www.ijest.info/docs/IJEST10-02-09-124.pdf">
Applications of graph ...</A>
, Published in Intern. J. Engin. Sci. Techn., Vol 2.

<BR>This plenary talk by Harold W. Kuhn cites private 
communication and presents some photos of M. Hujter: 
<A href="http://www.euro2010lisbon.org/?content=keynote#KUHN">
A tale of three ...</A>

<BR>This paper by Ehmsen and Larsen cites the PrExt1 paper:
<A href="http://www.math.bme.hu/~hujter/ehmsen10.pdf">
A technique for ...</A>

<BR>This paper by Ehmsen and Larsen cites PrExt:
<A href="http://www.imada.sdu.dk/~kslarsen/Archive/">Testing a technique for ...</A>

<BR>This thesis by Eory, written in Magyar, cites the PrExt1 paper: 
<A href="http://www.math.bme.hu/~hujter/ezoli.pdf">PrExt ...</A>
, Defended at TU, Budapest.  

<BR>This thesis by Fabulya, written in Magyar, cites the Miskolc97 book: 
<A href="http://phd.ke.hu/fajlok/1291984122-fabulya_zoltan_ertekezes.pdf">
Koltseggazdalkodasi ...</A>
, The thesis was defended at the Kaposvar University, Hungary
(Supervisors: Gyongyi Bankuti and Bela Csukas). 

<BR>This paper by Gaspers cites the SIAM paper: 
<A href="http://www.kr.tuwien.ac.at/drm/gaspers/SergeBookETA2010_print.pdf">
Exponential time algorithms ...</A>

<BR>This paper by Havasi, written in Magyar, cites the MATLAB paper: 
<A href="http://nimbus.elte.hu/~hagi/segedanyag/seged.html">
A MATLAB alapjai</A>

<BR>This paper by Henrion and Romisch cites the Weierstrass paper: 
<A href="http://www.springerlink.com/content/h61315r6158v25x3/fulltext.pdf">
Lipschitz and differentiability ...</A>
, Published in Ann. Oper. Res., Vol 177.

<BR>This paper by Ivanyi and Nemeth cites the PrExt1,PrExt2, PrExt3 papers: 
<A href="http://www.math.bme.hu/~hujter/tony__10.pdf">
List coloring of ...</A>
, Published in the Proc. 8th Joint Conf. Math. Comp. Sci. 2010, Slovakia.

<BR>This paper by Karuno, Tachibana and Yamashita cites the MMOR paper: 
<A href="http://www.jstage.jst.go.jp/article/jamdsm/4/3/4_664/_article">
Complexity of the ...</A>
, Published in J. Adv. Mech. Design ..., Vol. 4.

<BR>This paper by Karuno, Lu and Yamashita cites the MMOR paper: 
<A href="http://www.orsj.or.jp/~archive/pdf/e_mag/Vol.53_3_220.pdf">
An inaproximability of ...</A>
, Published in J. Oper. Res. Soc. Japan, Vol. 53. 

<BR>This paper by Li and Liang cites the Networks and the SIAM papers: 
<A href="http://www.math.bme.hu/~hujter/li____10.pdf">
Trees with large ...</A>
, Published in Int. J. Contemp. Math. Sci., Vol. 5. 

<BR>This paper by Nagy-Gyorgy cites 'helpful observations': 
<A href="http://www.informatik.uni-trier.de/~ley/db/journals/orl/orl38.html">
Online coloring graphs with ...</A>
, Published in Oper. Res. Lett., Vol. 38.

<BR>This paper by Pereira and Palsberg cites the PrExt1 paper: 
<A href="http://www.springerlink.com/content/67h47qx760143658/">Punctual coalescing</A>
, Published in LNCS, Vol. 6011.

<BR>This paper by Racham cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://portal.acm.org/citation.cfm?id=1836306.1836457">
The complexity of changing ...</A>
, Published in Inform. Proc. Lett., Vol. 110.

<BR>This review form 2010, by Stanchescu cites the SIAM paper:
<A href="http://math.bme.hu/~hujter/MR2548662.gif">
MR2548662</A>
, Published in Mathematical Reviews, Vol. 2010m.

<BR>This extended abstract by Takenaga and Yamada cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://www.math.bme.hu/~hujter/grid.pdf">
Precoloring extension ...</A>
, appeared in the Proceedings of CGGA2010, Dalia, China. 

<BR>This paper by Tripathi cites the MO32 paper: 
<A href="http://www.emis.de/journals/INTEGERS/papers/k44/k44.pdf">
On the Frobenius ...</A>
, Published in Integers, Vol. 10.

<BR>This paper by Ujvari cites an example: 
<A href="http://bolyai.cs.elte.hu/opres/orr/">A few new upper bounds ...</A>
, Published in Oper. Res. Rep. 2010-03, Eotvos Univ., Budapest. 

<BR>This paper by Zhang cites the SIAM paper: 
<A href="http://m-hikari.com/ams/ams-2010/ams-65-68-2010/huaAMS65-68-2010.pdf">The maximum number ...</A>
, Published in Appl. Math. Sci., Vol. 4.

















<BR> <BR> <BR> Year 2009
<BR>

<BR>This thesis by Barrus cites the DM115 paper: 
<A href="http://www.bhsu.edu/LinkClick.aspx?fileticket=2D8AIk%2Fb96c%3D&tabid=7822">
On induced subgraphs ...</A>
, Defended at U. of Illinois at Urbana-Champaign; supervisor: D. West. 

<BR>This paper by Bonomo, Duran, and Marenco cites the PrExt1,PrExt2,PrExt3 papers: 
<A href="http://www.springerlink.com/content/48n04166606580w2">
Exploring the ...</A>

<BR>This paper by Bonomo, Faenza and Oriolo cites the PrExt1,PrExt2,PrExt3 papers: 
<A href="http://www.disp.uniroma2.it/users/oriolo/paperi/coloring.pdf">
On coloring problems ...</A>
, Published in Electr. Notes Disc. Math., Vol. 35. 

<BR>This paper by Broersma, Fomin, Golovach, and Paulusma cites the PrExt2 paper: 
<A href="http://www.springerlink.com/content/l86r753h15045304">
Three complexity results on ...</A>

<BR>This paper by Choudum and Karthick cites the DM115 paper: 
<A href="http://www.math.bme.hu/~hujter/choudu09.djvu">
A {P2UP3,C4}-free ...</A>
, Published in the Proc. of Indian-Taiwan Conf. ...

<BR>This thesis written in Russian by Dainiak cites the SIAM paper:
<A href="http://www.dissercat.com/content/otsenki-chisla-nezavisimykh-mnozhestv-v-grafakh-iz-nekotorykh-klassov">
Otsenki tshislo ...</A>
, Published as Artikul: 370503, in Moscow. 

<BR>This paper by Demange, de Werra, Escoffier, 
Monnot and Paschos cites the PrExt2,PrExt3 papers
<A href="http://portal.acm.org/citation.cfm?id=1507805">
Weighted coloring on ...</A>

<BR>This paper by Furmanczyk, Kosowski, Ries and Zylinski cites PrExt:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Mixed graph edge coloring</A>

<BR>This paper by Heggernes and Mancini cites the DM115 paper: 
<A href="http://portal.acm.org/citation.cfm?id=1537477&dl=GUIDE&coll=GUIDE&CFID=61583932&CFTOKEN=71554533">
Dynamically maitaining ...</A>

<BR>This paper by Hell and Nesetril cites the PrExt2, PrExt3 papers: 
<A href="http://www.cs.sfu.ca/~pavol/cspCCC.pdf">
Colouring ...</A>

<BR>This paper by Hua and Hou cites the SIAM paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
On graphs with the ...</A>

<BR>This paper by Jou and Lin cites the SIAM paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Trees with the ...</A>

<BR>This paper by Jin and Yan cites the Farber and the SIAM papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
The second largest ...</A>
, published in Taiwanese J. Math.., Vol 13. 

<BR>This paper by Jin and Yan cites the Farber and the SIAM papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Trees with the ...</A>
, published in Ars Cobin., Vol 93. 

<BR>This talk by Karthick cites the DM115 paper: 
<A href="http://math.cts.ntu.edu.tw/photo/T.%20Karthick-Taiwan-Slides.pdf">
On (P2UP3,C4)-free graphs</A>

<BR>This paper by Kopanos, Puigjaner, and Georgiadis cites the OMS paper: 
<A href="http://www.elsevier.com/wps/find/bookdescription.cws_home/720535/description#description">
The bi-level ...</A>
, Published in the Proc. PSE2009, Elsevier. 

<BR>This paper by Laurent and Hao cites the PrExt1 paper: 
<A href="http://www.info.univ-angers.fr/pub/hao/papers/IJMOR08.pdf">
List-graph colouring for ...</A>

<BR>This paper by Marx cites the PrExt1,PrExt2,PrExt3 papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Complexity results...</A>

<BR>This paper by Mosca cites the Networks papers: 
<A href="http://scholar.google.hu/scholar?hl=hu&lr=&cluster=358349973386609895&um=1&ie=UTF-8&ei=O_cTS5mlMsXD-QbbxumbDg&sa=X&oi=science_links&resnum=6&ct=sl-allversions&ved=0CCwQ0AIwBTgK">
Independent sets in ...</A>

<BR>This review by the Math. Rev. cites the PrExt1,PrExt2,PrExt3 papers: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317572097663244690">
MR2320583</A>

<BR>This review by the Math. Rev. cites Precoloring Extension: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
MR2531639</A>

<BR>This review by the Math. Rev. cites Precoloring Extension: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
MR2494997</A>

<BR>This paper by Pruchnewski and Voigt cites Precoloring Extension: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Precoloring extension for ...</A>

<BR>This thesis written in Portugese (Brazilian) with abstract in English by Rocha,
(supervised by Sales) cites the PrExt3 paper
<A href="http://math.bme.hu/~hujter/notfound.txt">
b-coloracoes de grafos</A>

<BR>This paper by Sales and Sampaio cites the PrExt3 paper: 
<A href="http://www.lia.ufc.br/~leonardosampaio/coloringmtight.pdf">
On the b-colorings of ...</A>

<BR>This paper by Sales and Sampaio cites the PrExt3 paper: 
<A href="ftp://ftp-sop.inria.fr/mascotte/Publications/LiSab.pdf">
b-colorings of ...</A>

<BR>This thesis by Saurabh cites the SIAM paper: 
<A href="ftp://ftp-sop.inria.fr/mascotte/Publications/LiSab.pdf">
Exact algorithms ...</A>

<BR>This paper by Sha cites the DM115 paper: 
<A href="http://d.wanfangdata.com.cn/Periodical_qqhrdxxb200903033.aspx">
The structure of ...</A>
,Published in the J. Qiqihar University, China, Vol. 3.

<BR>This thesis by Szabo, written in Magyar, cites the Aula book: 
<A href="http://www.math.bme.hu/~hujter/szape.pdf">
Merev koru ...</A>

<BR>This paper by Stettner cites the Aula book: 
<A href="http://kk2009.ke.hu/cikkek/Stettner.pdf">
Bipartite graphs and ...</A>

<BR>This paper by Voigt cites Precoloring Extension: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Precoloring extension for ...</A>

<BR>This paper by Wolfovitz cites the SIAM paper: 
<A href="http://cs.haifa.ac.il/~gwolfovi/sumfree_ejc.pdf">
Bounds on the number ...</A>
, Published in European J. Combin., Vol 30.

<BR>This paper by Jin and Yan cites the SIAM paper: 
<A href="http://www.m-hikari.com/ijcms-password2009/1-4-2009/yanIJCMS1-4-2009.pdf">
Integers for the ...</A>

<BR>This thesis by Xu cites the Ramanujan paper: 
<A href="http://uwspace.uwaterloo.ca/bitstream/10012/4574/1/xu_zhi.pdf">
The Frobenius problem in ...</A>
, Defended at U. of Waterloo, Canada; supervisor: R. Trefler.

<BR>This review by the Zentralblatt cites Precoloring Extension: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:05601632&type=pdf&format=complete">
Zbl pre05601632</A>

<BR>This review by the Zentralblatt cites Precoloring Extension: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:05565371&type=pdf&format=complete">
Zbl pre05565371 </A>

<BR>This review by the Zentralblatt cites Precoloring Extension: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:05561160&type=pdf&format=complete">
Zbl pre05561160</A>








<BR> <BR> <BR> Year 2008
<BR>

<BR>This paper by Alekseev, Lozin, Malyshev and Milanic cites the Networks paper: 
<A href="http://www.springerlink.com/content/68t71qh7v54291u4">
The maximum independent ...</A>

<BR>This paper by Barrus, Hartke and Kumbhat cites the DM115 paper: 
<A href="http://www.math.uiuc.edu/~mbarrus2/papers/DSFtriples.pdf">
Non-minimal ...</A>

<BR>This paper by Blum and Rosenschein cites PrExt1: 
<A href="https://www.aaai.org/Papers/AAAI/2008/AAAI08-004.pdf">
Multiagent graph coloring ...</A>

<BR>This paper by Blum, Rosenschein and Branzei cites Precoloring Extension: 
<A href="http://www.cs.uwaterloo.ca/~klarson/teaching/F08-886/talks/Simina.pdf">
Multiagent graph coloring ...</A>

<BR>This paper by Bonomo, Cecowski, Duran, and Marenco cites PrExt1, PrExt2, PrExt3: 
<A href="http://mate.dm.uba.ar/~fbonomo/docs/charlas/coloring_roma_2008_stampa.pdf">
On variations of ...</A>

<BR>This bibliography by Brandstadt, Le and Spinrad cites the PrExt3 paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Graph classes: a bibliograph</A>

<BR>This paper by Bjorklund cites the SIAM paper: 
<A href="http://www.cs.lu.se/home/Thore_Husfeldt/papers/xsat.pdf">
Exact algorithms ...</A>

<BR>This paper by Bjorklund and Husfeldt cites the SIAM paper: 
<A href="http://www.springerlink.com/content/lp241v54q2854859/">
Exact algorithms ...</A>

<BR>This paper by Chlebik and Chlebikova cites the PrExt1,PrExt2 papers: 
<A href="http://www.math.bme.hu/~hujter/notfound.txt">Hard coloring problems in ...</A>

<BR>This review by Collins cites the PrExt1,PrExt2,PrExt3,PrExt4 papers: 
<A href="http://www.math.bme.hu/~hujter/notfound.txt">MR2325794</A>

<BR>This paper by de Werra and Ries cites the PrExt2 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
On two coloring problems in ...</A>

<BR>This paper by Epstein, Levin, and van Stee cites the PrExt3 paper: 
<A href="http://www.springerlink.com/content/a0118866x7483576/">
Two-dimensional ...</A>
, Published in LNCS 4639 (ed. by G. Goos, J. Hartmanis and J. van Leeuwen).

<BR>This paper by Galinier, Hertz, Paros, and Pesant cites the PrExt1 paper: 
<A href="http://www.gerad.ca/fichiers/cahiers/G-2008-02.pdf">
Using local search ...</A>

<BR>This paper by Gaspers, Kratsch, and Liedloff cites the SIAM paper: 
<A href="http://www.springerlink.com/content/d775732144n74313">
On independent sets and ...</A>

<BR>This thesis by Gaspers cites the SIAM paper: 
<A href="https://bora.uib.no/bitstream/1956/3436/1/Dr.thesis_Serge_Gaspers.pdf">
Exponential time ...</A>

<BR>This paper by Hell and Nesetril cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
Coloring, ...</A>
Published in Comp. Sci. Review, Vol. 2.  

<BR>This review by Hutchinson and Moore cites the PrExt1,PrExt2,PrExt3,PrExt4 papers: 
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
Distance constraints in ...</A>

<BR>This paper by Jin and Li cites the Networks and the SIAM papers: 
<A href="http://www.math.bme.hu/~hujter/jin___08.pdf">
Distance constraints in ...</A>

<BR>This paper by Koh, Goh, and Dong cites the ... paper: 
<A href="http://www.math.bme.hu/~hujter/koh___08">
The maximum number of ...</A>

<BR>This paper by Krishnamoorthy cites the Ramanujan paper: 
<A href="http://www.math.wsu.edu/math/faculty/bkrishna/Papers/ORL_BB_Bounds.pdf">
Bounds on the size of ...</A>

<BR>This paper by Lee, Palsberg, and Pereira cites the PrExt1 paper: 
<A href="http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V1G-4SPJ1X7-1&_user=303407&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1046599185&_rerunOrigin=scholar.google&_acct=C000016619&_version=1&_urlVersion=0&_userid=303407&md5=0b36a1fcb3a4741699892d6c17dfa273">
Aliased register allocation for ...</A>
, published in Theoret. Comput. Sci., Vol. 407. 

<BR>This paper by Lonc and Truszczynski cites the SIAM paper: 
<A href="http://www.math.bme.hu/~hujter/lonc__08.pdf">
On the number of ...</A>

<BR>This paper by Lozin cites precoloring extension: 
<A href="http://www.springerlink.com/content/c421216lhqq93g20/fulltext.pdf">
From the tree-width to ...</A>

<BR>This paper by Lozin and Milanic cites the Networks paper: 
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
A polynomial algorithm to ...</A>

<BR>This paper by Palsberg and Pereira cites the PrExt1 paper: 
<A href="http://llvm.org/pubs/2008-06-PLDI-PuzzleSolving.pdf">
Register allocation for ...</A>

<BR>This paper by Pereira cites the PrExt1 paper: 
<A href="http://compilers.cs.ucla.edu/fernando/publications/drafts/survey.pdf">
A survey on register allocation ...</A>

<BR>This thesis by Pereira cites the PrExt1 paper: 
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
A survey on register allocation ...</A>

<BR>This book, written in Magyar by Pokoradi cites Numerikus book: 
<A href="http://www.mfk.unideb.hu/userdir/pokoradi/rendsz_foly_mod.pdf">
Rendszerek ...</A>

<BR>This thesis by Saurabh cites the SIAM paper: 
<A href="http://www.imsc.res.in/xmlui/handle/123456789/119">
Exact algorithms for ...</A>
, Defended at Homi Bhabha Nat. Inst., India; supervisor: V. Raman.

<BR>This book written in German by Schoner cites the OMS paper:
<A href="http://74.125.155.132/scholar?q=cache:y5J-OgAb7OoJ:scholar.google.com/&hl=hu&as_sdt=2000">
Operative Produktionsplanung ...</A>
, Published by Kassel Univ. Press [ISBN 978-3-89958-335-9]. 

<BR>This review by Sereni cites Precoloring Extension: 
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
MR2299709</A>

<BR>This paper by Voigt cites Precoloring Extension: 
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
Precoloring extension for ...</A>

<BR>This review by Zhao cites the PrExt1,PrExt2 papers: 
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
MR2254338</A>











<BR> <BR> <BR> Year 2007
<BR>

<BR>This paper written in Russian by Alekseev cites the Networks paper: 
<A href="http://www.mathnet.ru/links/1d8ab620894c44046df8d941baecea7f/dm_967_refs.pdf">
Verhniaia ...</A>

<BR>This paper by Barriere and Miralles cites the Ramanujan paper: 
<A href="http://upcommons.upc.edu/e-prints/bitstream/2117/1170/1/frobenius%28juliol%29-opt.pdf">
The Frobenius problem ...</A>

<BR>This paper by Brandenburg, and Tolle cites the Burkard paper: 
<A href="http://www.springerlink.com/content/50056140744230kg">
MILP-based campaign scheduling in ...</A>

<BR>This paper by Brandstadt and Hoang cites the Networks paper: 
<A href="http://portal.acm.org/citation.cfm?id=1322038">
On clique separators ...</A>

<BR>This paper by Brandstadt, Le and Mahfud cites the Networsks paper: 
<A href="http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V1G-4MC81PN-1&_user=10&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1062762710&_rerunOrigin=google&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=07ab3e99fcf2dd576899a87c833f9c6c">
New applications of ...</A>

<BR>This paper by Burkard and Hatzl cites the OMS paper: 
<A href="http://www.springerlink.com/content/x51m4431u57245tw/">
Modelling and optimizing ...</A>

<BR>This paper by Chlebikova and Jansen cites the PrExt papers: 
<A href="http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V00-4MGVJ9N-3&_user=303407&_coverDate=07%2F28%2F2007&_rdoc=1&_fmt=high&_orig=search&_origin=search&_sort=d&_docanchor=&view=c&_searchStrId=1477303206&_rerunOrigin=scholar.google&_acct=C000016619&_version=1&_urlVersion=0&_userid=303407&md5=dd71e8fccc3641d0892c090dd76c381a&searchtype=a">
The d-precoloring problem ...</A>

<BR>This paper by Duran cites the PrExt1 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Graph coloring problems</A>

<BR>This paper by Epstein and Levin cites the PrExt3 paper: 
<A href="http://www.springerlink.com/content/058j450j6m514126/">
On bin packing ...</A>

<BR>This paper by Fellows, Fomin, Lokshtanov, Rosamond, Saurabh, Szeider and Thomassen 
cites Precoloring Extension: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
On the complexity of ...</A>

<BR>This paper by Fomin, Heggernes, and Kratsch cites the SIAM paper: 
<A href="http://www.springerlink.com/content/w144g27481436866">
Exact algorithms for ...</A>

<BR>This paper by Gamache, Hertz, and Ouellet, cites the PrExt1 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
A graph coloring model for ...</A>

<BR>This paper by Gernert and Rabern, cites the DM115 paper: 
<A href="http://scindeks.nb.rs/article.aspx?artid=0340-62530702445G">
A knowledge-based system for ...</A>
Published in Communic. Math. Comput. Chemistry / MATCH, Vol. 58. 

<BR>This paper by Gorska and Skupien cites the SIAM paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Trees with ...</A>
Discrete Math. 307

<BR>This paper by Grund and Hack cites the PrExt1 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
A fast cutting-plane ...</A>
Published in CC 2007, LNCS 4420.

<BR>This paper by Heggernes and Mancini cites the DM115 paper: 
<A href="http://portal.acm.org/citation.cfm?id=1537477">
Dynamically maintaining ...</A>

<BR>This paper by Henrion cites the Weierstrass paper: 
<A href="http://www-eio.upc.es/research/gnom/meccyt06-08/files/Henrion07_res.pdf">
Chance-constrained ...</A>

<BR>This paper by Kolen, Lenstra, Papadimitriou and Spieksma cites the PrExt1 paper:
<A href="http://www.econ.kuleuven.ac.be/public/NDBAE03/papers/nrl2007kolenpaper.pdf">
Interval Scheduling: ...</A>

<BR>This paper by Hutchinson and Moore, cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://portal.acm.org/citation.cfm?id=1243556">
Distance constraints in ...</A>

<BR>This paper by Jin and Li cites the Networks and the SIAM papers: 
<A href="http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V00-4R71S2S-4&_user=303407&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1046607404&_rerunOrigin=scholar.google&_acct=C000016619&_version=1&_urlVersion=0&_userid=303407&md5=f1204dc8273c0709da47a75e28492736">
Graphs with the second largest ...</A>

<BR>This paper by Jost, Leveque and Maffray cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://hal.archives-ouvertes.fr/ccsd-00008354">
Precoloring ...</A>

<BR>This paper by Le, and de Ridder cites the PrExt3 paper: 
<A href="http://drops.dagstuhl.de/opus/volltexte/2007/1270/pdf/07211.LeVanBang.ExtAbstract.1270.pdf">
Characterizations and...</A>

<BR>This paper by Lonc and Truszczynsky cites the SIAM paper: 
http://cs.engr.uky.edu/ai/papers.dir/mintrans.pdf">
On the number of ...</A>

<BR>This paper by Lozin and Milanic cites the Networks paper: 
<A href="http://books.google.hu/books?id=EbBWmmPcjPIC&pg=PA880&lpg=PA880&dq=Hujter+Farber+clique&source=bl&ots=_xGGiVJcYt&sig=VjojrbcZ0pXbfTll2TKEfgX-zww&hl=hu&ei=dk3kStv2EpHz_Abqs8W0Cg&sa=X&oi=book_result&ct=result&resnum=3&ved=0CBcQ6AEwAjgK#v=onepage&q=Hujter%20Farber%20clique&f=false">
Maximum independent ...</A>
<A href="http://arxiv.org/PS_cache/math/pdf/0602/0602191v4.pdf">( <== preliminary version )</A>

<BR>This paper by Marx cites the PrExt papers: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317572106364682306">
Precoloring ...</A>
<BR>This paper written in French by Maffray and Sebo cites the PrExt3 paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
GDR RO Projet ...</A>

<BR>This paper written in Magyar by Meszaros and Olah cites the Ph.D. dissertation 
and other papers:
<A href="http://store1.digitalcity.eu.com/store/clients/release/musz_fuz_07.pdf">
Negyzetek teglalapba pakolasanak ...</A>
, Published in Pkoradi (ed.): Muszaki Tudomany ..., Debrecen (Hungary).  

<BR>This paper written in Magyar by Olah cites the Miskolc97 textbook:
<A href="http://math.bme.hu/~hujter/notfound.txt">
A korutazasi problemak ...</A>
, Published in the Szolnoki Tudomanyos Kozlemenyek (Hungary), Vol. 9

<BR>This paper by Porschen and Speckenmeyer cites ... paper: 
<A href="http://math.bme.hu/~hujter/porsch07.pdf">
Satisfiability of ...</A>

<BR>This thesis written in Garman by Schoner cites the OMS paper: 
<A href="http://74.125.155.132/scholar?q=cache:y5J-OgAb7OoJ:scholar.google.com/&hl=hu&as_sdt=2000">
Operative Produktionsplanung in der ...</A>
, Defended at Kassel Univ., Germany; supervisor: R. Vahrenkamp.  

<BR>This thesis by Raman, Saurabh and Sikdar cites the SIAM paper: 
<A href="http://www.springerlink.com/content/e3284475848104m2">
Efficient exact ...</A>

<BR>This paper by Ries cites the PrExt2 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Coloring some classes of ...</A>

<BR>This thesis by Ries cites the PrExt2 paper: 
<A href="http://biblion.epfl.ch/EPFL/theses/2007/3968/EPFL_TH3968.pdf">
Variations of coloring ...</A>
, Defended at EPA, France; supervisor: D. de Werra.

<BR>This book by Szabo, Markot, Csendes, Specht, Casado and Garcia cites the disk packing paper:
<A href="http://www.springerlink.com/content/m86v2x/#section=264746&page=1">
New approaches to ...</A>

<BR>This review by Thomason cites the PrExt3 paper: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317572106364682306">
MR2279181</A>

<BR>This bibliography written by van der Vlerk cites the SPEPS paper:
<A href="http://www.eco.rug.nl/mally/biblio/STOPROG.PDF">
Stochastic programming ...</A>

<BR>This paper by Wood cites the Networks paper: 
<A href="http://www.springerlink.com/content/86343218381m4017/">On the maximum ...</A>

<BR>This review by the Zentralblatt cites Precoloring Extension: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/">
Zbl 1118.05032</A>

<BR>This review by the Zentralblatt cites the PrExt1,Prext2,PrExt3 papers: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:05189131&type=pdf&format=complete">
Zbl 1123.05038</A>

<BR>This review by Zerovnik cites the PrExt2 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
MR2281351</A>











<BR> <BR> <BR> Year 2006
<BR>
 
<BR>This paper by Bonomo, Duran, and Marenco cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://www.dii.uchile.cl/~gduran/docs/papers/SIAMJDM_DuMBo_subm.pdf">
Exploring ...</A>

<BR>This paper by Burkard and Hatzl cites the OMS paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
A complex time based ...</A>

<BR>This paper by Chlebik and Chlebikova cites the Prext1, Prext2 papers: 
<A href="http://portal.acm.org/citation.cfm?id=1182780">
Hard coloring ...</A>

<BR>This thesis by Cieslik cites the DM115 paper:
<A href="http://www.tcs.uj.edu.pl/docs.php?id=22">
On-line graph coloring</A>
, Defended at Jagiellonian University, Cracow, Poland;
supervisor: P. M. Idziak.

<BR>This paper by Erdelyi and Toth cites the Miskolc97 textbook:
<A href="http://math.bme.hu/~hujter/erdely06.pdf">
Systems engineering ...</A>
, Published in J. Univ. Comput. Sci., Vol. 12. 

<BR>This paper by Even and Sharar cites Precoloring Extension:
<A href="http://www.springerlink.com/content/yr77318688631461/fulltext.pdf">
Scheduling of a smart ...
</A>
, Published in CAAN 2006, Chester, UK; LNCS 4235 (ed. by Erlebach). 

<BR>This paper by Hougardy cites the PrExt3 paper: 
<A href="http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V00-4KJTNMY-1&_user=303407&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1077597163&_rerunOrigin=scholar.google&_acct=C000016619&_version=1&_urlVersion=0&_userid=303407&md5=b0e0f6f280ea270ee1d78083b4333d56">
Classes of ...</A>

<BR>This paper by Jansen and Scheffler cites PrExt papers: 
<A href="http://www.springerlink.com/content/712685vj3l6w2613/">
Generalized coloring for ...</A>

<BR>This paper by Jia cites the Ramanujan paper: 
<A href="http://erdos.math.txstate.edu/lectures/CANT2006_exact.pdf">
Exact order of ...</A>

<BR>This paper by Kawarabayashi and Mohar cites the PrExt1 and AGIFORS papers: 
<A href="http://www.imfm.si/preprinti/PDF/01007.pdf">
Approximating the ...</A>
, Published in Preprint Series, Univ. Ljubljana, Slovenia, Vol. 44.

<BR>This paper by Marx cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://scholar.google.hu/scholar?cluster=4603629861867147266&hl=hu">
Precoloring extension on ...</A>

<BR>This paper by Marx cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Parametrized coloring problems on ...</A>

<BR>This paper by Mendez, Cerda, Grossmann, Harjunkoski, and Fahl cites the OMS paper: 
<A href="http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6TFT-4JRKVMS-2&_user=303407&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1077647653&_rerunOrigin=scholar.google&_acct=C000016619&_version=1&_urlVersion=0&_userid=303407&md5=b2860dd1e8e4e81fbdd16e4cc322a802">
State-of-the-art review of ...</A>

<BR>This review by Monnot cites the PrExt1, PrExt2, PrExt3 and AGIFORS papers: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317572105758404354">
MR2212549</A>

<BR>This paper by Monnot cites the PrExt2 paper: 
<A href="http://www.lamsade.dauphine.fr/~monnot/index_fichiers/PreExt.pdf">
A note on the ...</A>
, Published in Foundations of Computing and Decision Sciences, Vol. 31.

<BR>This book by Murat and Paschos cites the definition of 1-PrExt and precoloring extension:
<A href="http://www.iste.co.uk/index.php?p=a&ACTION=View&id=54">
Probabilistic combinatorial ...</A>
, Published by Wiley-ISTE [ISBN: 9781905209330].

<BR>This paper by Pedersen and Vestergaard cites the SIAM paper: 
<A 
href="http://journal.taiwanmathsoc.org.tw/index.php/TJM/article/viewFile/973/814">
Bounds on the ...</A>
, Published in the Taiwanese J. Math ., Vol. 10. 

<BR>This paper by Quaddoura cites the DM115 paper:
<A href="http://www.ccis2k.org/iajit/PDF/vol.3,no.2/8-Ruzyn.pdf">
Operator decomposition ...</A>
,Published in Internat. Arab J. Inform. Techn., Vol. 3.

<BR>This paper by Ramirez Alfonsin cites the Miskolc99 paper: 
<A href="http://users.encs.concordia.ca/~chvatal/perfect/papers.html">
Perfect papers</A>

<BR>This review by the Zentralblatt cites the PrExt3 paper: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:05030489&type=pdf&format=complete">
Zbl 1090.05028</A>









<BR> <BR> <BR> Year 2005
<BR>

<BR>This paper by Bjorklund and Husfeldt cites the SIAM paper: 
<A href="http://www.cs.lu.se/home/Thore_Husfeldt/papers/exact.pdf">
Polynomial space ...</A>

<BR>This paper by Bonomo and Cecowski cites the PrExt2 paper: 
<A href="http://scholar.google.hu/scholar?cluster=3360547262553754080&hl=hu">
Between coloring and ...</A>

<BR>This thesis by Bottcher cites the PrExt1 paper: 
<A href="http://www-m9.ma.tum.de/foswiki/pub/Allgemeines/JuliasVeroeffentlichungen/Boettcher_Diplomarbeit.pdf">
Coloring sparse random ...</A>

<BR>This paper by Brandstadt, Le, and Mahfud cites the ... papers: 
<A href="http://www.springerlink.com/content/72pyaahdjgpr7ha1/">
New applications of ...</A>

<BR>This paper by Burkard and Hatzl cites the OMS paper: 
<A href="http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6TFT-4FY9MBH-2&_user=303407&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1077642670&_rerunOrigin=scholar.google&_acct=C000016619&_version=1&_urlVersion=0&_userid=303407&md5=de96a4a0493cb41f8fc5da3b19b755e4">
Review, extensions and ...</A>

<BR>This paper by Csendes, Markot and Szabo cites the disk packing paper:
<A href="http://www.springerlink.com/content/p691733320671254/">Global optimization in ...</A>


<BR>This thesis, written in French by Escoffier, cites the PrExt2 and PrExt3 papers:
<A href="http://www.lamsade.dauphine.fr/~escoffier/fichiers/TheseEscoffier.pdf">
Approximation polynomiale</A>

<BR>This paper by Fiala, Kratochvil, and Proskurowski cites the Networks and the PrExt3 papers: 
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
Systems of ...</A>

<BR>This paper by Gamache ... cites the PrExt1 paper: 
<A href="http://www.gerad.ca/fichiers/cahiers/G-2005-34.pdf">
A graph coloring ...</A>

<BR>This paper by Fouquet, Giakoumakis, Maire, and Thuillier cites the DM115 paper: 
<A href="http://scholar.google.hu/scholar?cluster=11553738292812897241&hl=hu&as_sdt=2000">
On graphs without ...</A>

<BR>This paper by Jost, Leveque, and Maffray cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://arxiv.org/abs/cs.DM/0509004">
Precoloring ...</A>

<BR>This paper by Jou, Chang, Lin, and Ma cites the SIAM paper: 
<A href="http://www.springerlink.com/content/r70r310663780745/">
A finiteness theorem for ...</A>

<BR>This review from 2005 by Kratsch cites the PrExt3 paper:
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
MR2063372</A>
 
<BR>This paper by Lozin and Milanic cites the Networks paper: 
<A href="http://rutcor.rutgers.edu/pub/rrr/reports2005/30_2005.pdf">
A polynomial algorithm ...</A>

<BR>This paper by Lozin and Mosca cites the Networks paper: 
<A href="http://portal.acm.org/citation.cfm?id=1080505">
Independent sets in ...</A>

<BR>This paper by Porschen and Speckenmeyer cites the SIAM paper: 
<A href="http://www.springerlink.com/content/2xd4uvnt1pg3kmar/">
Worst case bounds for ...</A>

<BR>This book by Ramirez Alfonsin cites the MO32, MO43, MO44, MN31, MN32, 
Optimization and Ramanujan papers: 
<A ref="http://gen.lib.rus.ec/get?md5=0304dc0508792869526920742b411e89">
The diophantine ...</A>

<BR>This book chapter by Vizvari cites the ELTE Doctoral Thesis: 
<A href="http://compalg.inf.elte.hu/~tony/Elektronikus/Informatikai/09H.xml">
Utemezeselmelet</A>












<BR> <BR> <BR> Year 2004
<BR>

<BR>This paper by Alekseev, Korobitsyn, and Lozin cites the Networks paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Boundary classes of ...</A>

<BR>This paper by Alexe, Hammer, Lozin and de Werra cites the Farber paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Struction revisited</A>

<BR>This paper by Arkin, Hassin, Rubinstein, and Sviridenko cites the MMOR paper: 
<A href="http://www.math.tau.ac.il/~hassin/transp_04.pdf">
Approximations for ...</A>

<BR>This paper by Berning, Brandenburg, Gursoy, Kussi, Mehta, and Tolle cites the OMS paper: 
<A href="http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6TFT-4B4PTTX-1&_user=303407&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1077658683&_rerunOrigin=scholar.google&_acct=C000016619&_version=1&_urlVersion=0&_userid=303407&md5=27bc8dbd9e8fd29af9e3dbacde99c375">
Integrating ...</A>

<BR>This paper by Byskov cites the SIAM paper: 
<A href="http://math.bme.hu/~hujter/byskov04.pdf">
Enumerating ...</A>

<BR>This thesis by Byskov cites the SIAM paper: 
<A href="http://math.bme.hu/~hujter/byskov04.pdf">
Exact algorithms ...</A>

<BR>This paper by Dantas, Gravier, and Maffray cites the DM115 papers: 
<A href="http://portal.acm.org/citation.cfm?id=1017378&dl=GUIDE&coll=GUIDE&CFID=61583932&CFTOKEN=71554533">
Extremal graphs for ...</A>
, Published in Discret Appl. Math., Vol. 141 

<BR>This thesis by Kiss cites the MO32 and MO43 paperr: 
<A href="http://www.szolda.hu/kg/frobenius2/index.html">
Frobenius ...</A>

<BR>This thesis by Marx cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://www.cs.bme.hu/~dmarx/papers/marx-phd.pdf">
Graph coloring with ...</A>
, Defended at BME, Budapest (supervisor: K. Friedl).

<BR>This thesis by Marx cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://www.pp.bme.hu/ee/2004_1/pdf/ee2004_1_02.pdf">
Graph coloring with ...</A>

<BR>This paper by Marx cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://www.cs.bme.hu/~dmarx/papers/planar-edge-prext.pdf">
NP-completeness of ...</A>

<BR>This paper by Poder, Beldiceanu, and Sandlaville cites the ... papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Computing a lower ...</A>

<BR>This paper by Tichler cites the SIAM paper: 
<A href="http://www.springerlink.com/content/m152405w50657317">
Extremal theorems for ...</A>

<BR>This paper by Zverovich and Zverovich cites the PrExt3 paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Forbidden induced ...</A>
J. Graph Theory 46

<BR> <BR> <BR> Year 2003
<BR>

<BR>This paper by Alexe, Hammer, and Lozin cites the Networks paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Struction revisited</A>

<BR>This paper by Brown, Chou, and Shiue cites the Ramanujan paper: 
<A href="http://ajc.maths.uq.edu.au/pdf/27/ajc_v27_p193.pdf">
On the partition ...</A>

<BR>This paper written in French, by de Werra and Kobler cites the PrExt1 papers: 
<A href="http://archive.numdam.org/ARCHIVE/RO/RO_2003__37_1/RO_2003__37_1_29_0/RO_2003__37_1_29_0.pdf">
Coloration de graphes ...</A>

<BR>This paper written in French by de Werra and Kobler cites the PrExt papers: 
<A href="http://www.rairo-ro.org/index.php?option=article&access=standard&Itemid=129&url=/articles/ro/ref/2003/01/ro2310/ro2310.html">
Coloration de ...</A>

<BR>This paper by Fiala cites the PrExt1 paper: 
<A href="http://www3.interscience.wiley.com/journal/104527526/abstract?CRETRY=1&SRETRY=0">
NP completeness of ...</A>

<BR>This paper by Gerber and Lozin cites the DM115 paper: 
<A href="http://portal.acm.org/citation.cfm?id=638327&dl=GUIDE&coll=GUIDE&CFID=61583932&CFTOKEN=71554533">
On the stable ...</A>

<BR>This book by Ivanyi, written in Magyar cites the Miskolc97 textbook: 
<A href="http://compalg.inf.elte.hu/~tony/Elektronikus/Parhuzamos/ParalgH.xml">
Parhuzamos algoritmusok</A>

<BR>This paper by Kallrath cites the OMS paper: 
<A href="http://scholar.google.hu/scholar?cluster=1063263461442489869&hl=hu&as_sdt=2000">
Planning and scheduling in ...</A>

<BR>This paper by Kierstead and Tuza cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://www.springerlink.com/content/nxjq4p7n9mnd6jrq/">
Marking games and ...</A>

<BR>This paper by Marx cites the PrExt1 paper: 
<A href="http://www.cs.bme.hu/~dmarx/papers/circularNP.pdf">
A short proof of ...</A>

<BR>This review by Math. Rev. cites the PrExt3 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
MR1835588</A>

<BR>This paper by Owens cites the Ramanujan paper: 
<A href="http://www.jstor.org/stable/3219081">
An algorithm to solve ...</A>

<BR>This book by Schrijver cites the Miskolc99 paper: 
<A href="http://www.springer.com/mathematics/applications/book/978-3-540-44389-6">
Combinatorial optimization ...</A>
, Published by Springer [ISBN: 978-3-540-44389-6].

<BR>This review by Thomason cites Precoloring Extension: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
MR1928789</A>

<BR>This paper by Tichler cites the SIAM paper: 
<A href="http://www.springerlink.com/content/m152405w50657317/fulltext.pdf">
Extremal theorems ...</A>

<BR> This paper by Zverovich and Zverovich cites the PrExt3 paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
A solution to ...</A>
, Published in DIMACS Technical Report, Vol. 2003-36.

<BR> <BR> <BR> Year 2002
<BR>

<BR>This paper by Alekseev, Korobitsyn, and Lozin cites the Networks paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Boundary classes of ...</A>
, Published in DIMACS Technical Report, Vol. 2002-38

<BR>This paper by Arbib and Mosca cites the DM115 paper: 
<A href="http://portal.acm.org/citation.cfm?id=605182&dl=GUIDE&coll=GUIDE&CFID=61583932&CFTOKEN=71554533">
On (P5,diamond)-free graphs</A>

<BR>This paper by Berning, Brandenburg, Gursoy, Mehta and Kussi cites the OMS paper: 
<A href="http://www.nt.ntnu.no/users/skoge/prost/proceedings/focapo_2003/pdffiles/papers/006.pdf">
An integrated system solution for ...</A>

<BR>This paper by Bessy, Havet and Palaysi cites the AGIFORS paper: 
<A href="ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-4522.pdf">
Choosability of ...</A>
, Published in Inst. Nat. de Rech ..., No. 4522.

<BR>This paper by Burkard, Fortuna and Hurkens cites the OMS paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
An event-driven model ...</A>

<BR>This paper by Burkard, Fortuna and Hurkens cites the OMS paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Makespan minimization for ...</A>

<BR>This paper by Chang and Jou cites the SIAM paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Algorithmic aspects of ...</A>
, Published in Ars Combinatoria

<BR>This paper by Eisenblatter, Grotschel and Koster cites the PrExt1 paper: 
<A href="http://www.zib.de/groetschel/pubnew/paper/eisenblaettergroetschelkoster2002b.pdf">
Frequency planning and ...</A>

<BR>This paper by Garg, Papatriantafilou and Tsigas cites the PrExt1 paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Distributed long-lived ...</A>
, Published in Wirel. Netw., Vol. 8. 

<BR>This paper by Gravier, Kobler and Kubiak cites the PrExt1 paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Complexity of ...</A>
, Published in Discrete Appl. Math., Vol. 117.

<BR>This paper by Kallrath cites the OMS paper: 
<A href="http://www.springerlink.com/content/x37y2adh4ncgftx7/">
Planning and scheduling in ...</A>

<BR>This paper by Marx cites the PrExt2 paper: 
<A href="http://www.cs.bme.hu/~dmarx/papers/multicoloring-mfcs2002.pdf">
The complexity of ...</A>

<BR>This paper by Nielsen cites the SIAM paper: 
<A href="http://www.brics.dk/RS/02/15/BRICS-RS-02-15.pdf">
On the number of ...</A>

<BR>This paper by Qin and Zverovich cites the DM115 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Generalized cographs</A>

<BR>This paper by Remy and Thiel cites the Ramanujan paper: 
<A href="http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V15-4475YDR-3&_user=303407&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_rerunOrigin=scholar.google&_acct=C000016619&_version=1&_urlVersion=0&_userid=303407&md5=15e87a9b65c23973be193e5fe7f6f3e7">
Medial axis for ...</A>

<BR>This paper by Tichler cites the SIAM paper: 
<A href="http://www.springerlink.com/content/5p6dhr1h6alr5xxt/fulltext.pdf">
Extremal theorems ...</A>

<BR>This paper by Tuza cites the PrExt papers: 
<A href="http://www.ercim.org/publication/Ercim_News/enw50/tuza.html">
A colourful theory ...</A>

<BR>This paper by Tuza and Voigt cites the PrExt papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
A note on planar ...</A>, published in Discrete Math., Vol. 251. 

<BR>This paper by Volkman and Zverovich cites the irredundance(SzTAKI) paper: 
<A href="http://www.cems.uwe.ac.uk/~vzverovi/DisproofOfHenningsConjecture.pdf">
A disproof of Henning ...</A>, published in Discrete Math., Vol 254.

<BR>This book by Voloshin cites the PrExt1 paper: 
<A href="http://www.ams.org/bookstore-getitem/item=fim-17">
Coloring Mixed Hypergraphs: Theory ...</A>

<BR> <BR> <BR> Year 2001
<BR>

<BR>This paper by Brimkov and Barneva cites the MO43 paper: 
<A href="http://www.springerlink.com/content/u6cjw2a2pnq9d2ag/">
Gradient elements of ...</A>

<BR>This paper by Dantas, Gravier, Maffray, and Mohar cites the DM115 papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Extremal graphs for ...</A>

<BR>This review by Fisk cites Precoloring Extension: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
MR1805498</A>

<BR>This paper by Hoang and Le cites the PrExt3 paper: 
<A href="http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/140/387">
P4-free colorings and ...</A>

<BR>This thesis written in Portugese (Brazilian) by Manic cites the PrExt1 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">...</A>
Coloracoes ...</A>

<BR>This review by the Math. Rev. cites the EJC paper: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317572315113978754">
MR17887905</A>

<BR>This review by the Math. Rev. cites the PrExt1 paper: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317571740701792786">
MR1797680</A>

<BR>This review by the Math. Rev. cites the MathNotes paper: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317571936101735234">
MR1812566</A>

<BR>This paper written in Magyar by Szigeti 
cites the MO32, MO43, MN31, MN36, Networks, EJC, Ramanujan papers:
<A href="http://www.uni-miskolc.hu/uni/dept/gepesz/mat/jubileumi/algebrai_kutatasok.html">
Algebrai ...</A>








<BR> <BR> <BR> Year 2000
<BR>

<BR>This review by Brimkov cites the MMOR paper: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317571933199306290">
MR1711138</A>

<BR>This paper by Brucker and Hurink cites the OMS paper: 
<A href="http://www.springerlink.com/content/r642532g7t668331/">
Solving a chemical...</A>

<BR>This extended abstract by Burkard and Fortuna cites the OMS paper:
<A href="http://math.bme.hu/~hujter/fortuna.pdf">
An event-driven model ...</A>
, Published in Proc. PMS2000 (Project Managemant and Scheduling) in Germany 
(eds.: P. Brucker, S. Heitman, J. Hurink, S. Knust).

<BR>This book by Burkard, Fortuna, and Hurkens cites the OMS paper: 
<A href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.4781">
An event-driven model for ...</A>

<BR>This paper by Chang and Jou cites the Networks and the SIAM papers: 
<A href="http://front.cc.nctu.edu.tw/Richfiles/7351-94.pdf">
The number of ...</A>

<BR>This paper by Dantas, Gravier and Maffray cites the DM115 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Extremal graphs for ...</A>
Les cahiers du Laboratoire Leibniz-IMAG 18

<BR>This review by Dohmen cites the PrExt1 paper: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317571740701792786">
On the number of ...</A>

<BR>This book by Eisenblatter, Grotschel, and Koster cites the PrExt1 paper: 
<A href="http://citeseer.ist.psu.edu/old/401496.html">
Frequency planning ...</A>

<BR>This review by Engel cites the EJC paper: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:01538573&type=pdf&format=complete">
Zbl 0971.05109</A>

<BR>This paper by Fiala cites the PrExt1 paper: 
<A href="http://kam.mff.cuni.cz/~kamserie/serie/clanky/2000/s480.ps">
The NP-completeness ...</A>

<BR>This review by Kratsch cites the PrExt2,PrExt3 papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
MR1710244</A>

<BR>This paper by Lozin cites the DM115 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Stability in ...</A>
, Published in Eur. J. Oper. Res., Vol. 125.

<BR>This paper by Remy and Thiel cites the Ramanujan paper: 
<A href="http://www.springerlink.com/content/6xe11bf01kl4feqf/">
Computing the 3D ...</A>

<BR>This review by Rusu cites the PrExt3 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
MR1750861</A>

<BR>This review by Schulte cites the MathNotes paper: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:01604356&type=pdf&format=complete">
Zbl 1062.05110</A>

<BR>This paper by Schwindt and Trautmann cites the OMS paper: 
<A href="http://scholar.google.hu/scholar?cluster=10953853766370331828&hl=hu&as_sdt=2000">
State-of-the-art ...</A>

<BR>This thesis writen in Magyar by Simenfalvi cites personal communications:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Rugoterhelesu biztonsagi szelep ...</A>
, Defended at Miskolci Egyetem, Hungary.  

<BR>This paper by Tuza and Voloshin cites the PrExt1 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Uncolorable ...</A>
Discrete Applied Math. 99

<BR>This paper by Gaspar and Tarnai cites the disk packing paper: 
<A href="http://www.pp.bme.hu/ci/2000_1/pdf/ci2000_1_02.pdf">
Upper bound of desity for ...</A>









<BR> <BR> <BR> Year 1999
<BR>

<BR>This book by Albertson and Moore cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Extending ...</A>
, Published in J. Comb. Theory B, Vol. 77

<BR>This thesis written in Magyar by A. Banyai cites the Dortmund paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
A 'JUST IN TIME' beszallitasi ...</A>
, Defended at Miskolci Egyetem, Hungary (Supervisor: J. Cselenyi).

<BR>This thesis written in Magyar by T. J. Banyai cites the Dortmund paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Mobilrobotos ...</A>
, Defended at Miskolci Egyetem, Hungary (Supervisor: J. Cselenyi).

<BR>This thesis written in German by Brandenburg cites the Burkard paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Effiziente ...</A>
, Defended at Univ. Kiel; (Supervisors: R. Kolisch, A. Srivastav, F.-J. Tolle).

<BR>This book by Brandstadt, Le and Spinrad cites the DM115 paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Graph classes ...</A>
, Published in the SIAM Monographs on Discrete Mathematics and Applications, Vol. 3. 

<BR>This paper by Chang and Jou cites the SIAM and the Networks papers: 
<A href="http://www.math.ntu.edu.tw/~gjchang/publication/65.pdf">
The number of maximal ...</A>

<BR>This review by Foregger cites the PUM paper: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317571935890396690">
MR1745121</A>

<BR>This paper by Guruswami cites the DM115 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Enumerative aspects of ...</A>

<BR>This thesis by Hartmann cites the PrExt1 paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Layout problems ...</A>
, Defended at TU Berlin; supervisors: D. Wagner and R. H. Mohring. 

<BR>This review by Hoang cites PrExt3 paper:
<A href="http://math.bme.hu/~hujter/MR1669456.gif">
MR1669456</A>
, Published in Mathematical Reviews, Vol. 99m. 

<BR>This paper by Illes and Krarup cites the Farber and PrExt2 papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Maximum 4-block-free ...</A>

<BR>This paper by Kratochvil and Tuza cites the PrExt2,PrExt3 papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Rankings of ...</A>
, Published in SIAM J. Discrete Math., Vol 12. 

<BR>This paper by Kratochvil, Tuza, and Voigt cites the PrExt papers: 
<A href="http://www.google.com/books?hl=hu&lr=&id=aE_-qdthsWcC&oi=fnd&pg=PA183&dq=hujter+Voloshin&ots=Q-oOyi4766&sig=-RduPCNyz2vBvy6QHkHXiQ1EdVo#v=onepage&q=&f=false">
New trends in ...</A>

<BR>This review by Presia cites the PrExt3 paper: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:01275592&type=pdf&format=complete">
Zbl 0922.05045</A>

<BR>This thesis by Rusu cites the DM115 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Aspects theoriques et ...</A>

<BR>This paper by Szigeti cites the MO32, MO43, MN31, 
Ramanujan, MN36, Farber, Spissich papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Research in algebra during the ...</A>
, Published in PUM, Vol. 39.

<BR>This review by Vizvari cites the Ramanujan paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
MR1628714</A>

<BR>This review by the Zentralblatt cites the PUM paper: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:01604138&type=pdf&format=complete">
Zbl 0980.05025</A>

<BR>This review by the Zentralblatt cites the MMOR paper: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:01356499&type=pdf&format=complete">
Zbl 0967.90081</A>

<BR>This review by the Zentralblatt cites the CMA99 paper: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:01429518&type=pdf&format=complete">
Zbl 0946.52009</A>






<BR> <BR> <BR> Year 1998
<BR>

<BR>This talk by Albertson cites the PrExt1 paper:
<A href="http://dimacs.rutgers.edu/drei/1998/week3.html">
Extending Graph Colorings</A>
, DREI '98 Graph Theory and Combinatorial Optimization.

<BR>This book by Albertson cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
You can't paint ...</A>
, published in J. Comb. Theory B, Vol. 73

<BR>This review by Douglas cites Precoloring Extension: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
MR1451958</A>

<BR>This book by Haynes, Hedetniemi and Slater cites the irredundance paper: 
<A href="http://books.google.hu/books?id=Bp9fot_HyL8C&pg=PA405&lpg=PA405&dq=Hujter+irredundance&source=bl&ots=Iw2dHIhMbU&sig=ZGawBqPV6LdKkl3yCQqQcucgovk&hl=hu&ei=0nj0SvaaCI77_Ab33pCxAw&sa=X&oi=book_result&ct=result&resnum=1&ved=0CAcQ6AEwADge#v=onepage&q=Hujter%20irredundance&f=false">Fundamentals of ...</A>

<BR>This paper by Kratochvil, Tuza and Voigt cites the PrExt3 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">C
Complexity of ...</A>
Discrete Math. 191

<BR>This paper by Kratochvil, Tuza and Voigt cites the PrExt1 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
New trends in the ...</A>

<BR>This paper by Le cites the PrExt3 paper: 
<A href="http://www.informatik.uni-rostock.de/~le/Research/cocon.pdf">
A good characterization of ...</A>

BR>This thesis by Manlove cites the PrExt2 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Minimaximal and maximinimal ...</A>

<BR>This thesis by Voigt cites the PrExt1, PrExt2, PrExt3 papers:
<A href="http://math.bme.hu/~hujter/notfound.txt">
On list colourings and ...</A>

<BR>This review by the Zentralblatt cites the OMS paper: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:01422760&type=pdf&format=complete">
Zbl 0941.90034 </A>






<BR> <BR> <BR> Year 1997
<BR>

<BR>This paper by Chang and Jou cites the SIAM paper: 
<A href="http://front.cc.nctu.edu.tw/Richfiles/4784-63.pdf">
Maximal independent sets in ...</A> 

<BR>This paper by de Werra cites the PrExt1 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
The combinatorics of ...</A>
Eur. J. Oper. Res. 96

<BR>This paper by de Werra and Mahadev cites the PrExt papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Generalized coloring for ...</A>

<BR>This paper by Hertz cites the DM115 paper: 
<A href="http://www.gerad.ca/~alainh/Boolean.pdf">
On the use of Boolean methods for ...</A>
, Published in Discrete Apll. Math., Vol. 76.

<BR>This paper by Jansen cites the PrExt3 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">The optimum cost ...</A>

<BR>This paper by Jansen and Ohring cites the PrExt1, PrExt2, PrExt3 papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Approximation algorithms for ...</A>
, Published in Inform. and Comput, Vol. 132. 

<BR>This paper by Jansen and Scheffler cites the PrExt papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">Generalized coloring for ...</A>

<BR>This paper by Kratochvil and Sebo cites the PrExt papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Generalized coloring for ...</A>
, Published in J. Graph Theory, Vol. 25.

<BR>This paper by Mosca cites the DM115 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Polynomial algorithms for ...</A>
, Published in Inf. Process Lett., Vol. 61. 

<BR>This paper by Olejar and Topman cites the Networks paper: 
<A href="http://dml.cz/dmlcz/128939">
On the order and...</A>

<BR>This paper by Shevchenko cites the Ramanujan paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Qualitative topics in ...</A>

<BR>This paper by Tuza cites the PrExt1, PrExt2, PrExt3, AGIFORS, SIAM, Networks papers: 
<A href="http://www.zib.de/Publications/Reports/SC-97-31.pdf">
Graph colorings with ...</A>





<BR> <BR> <BR> Year 1996
<BR>

<BR>This paper by Bauslaugh cites the PrExt1 paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Cores and compactness of ...</A>
, Published in J. Comb. Theory B, Vol. 68.

<BR>This review by Blazewicz cites PrExt1 paper:
<A href="http://math.bme.hu/~hujter/MR1308879.gif">
MR1308879</A>
, Published in Mathematical Reviews, Vol. 96g. 

<BR>This paper by Chang, Jou, Lin and Ma cites the SIAM paper: 
<A href="http://www.springerlink.com/content/r70r310663780745/">
A finiteness theorem ...</A>
, Published in Graph and Combinatorics, Vol. 12.

<BR>This paper written in German by Emden-Weinert, Hougardy, Kreuter, Promel and Steger 
cites the SIAM and PrExt3 papers: 
<A href="http://www.informatik.hu-berlin.de/Institut/struktur/algorithmen/ga">
Einfuhrung in Graphen und ...</A>

<BR>This review by Gyarfas cites the DM115: 
<A href="http://www.math.bme.hu/~hujter/gyarfa96.gif">
MR1360104</A>
, Published in Math. Rev., Vol. 96i. 

<BR>This bibliography written by Kladiva and Santane-Toth cites the PrExt1 paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Hungarian artificial ...</A>
, Published NJSZT and OMIKK, Budapest.

<BR>This thesis written by Lau cites the PrExt1 paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
A simple yet effective ...</A>
Defended at Tokyo Institute of Technology, in Japan.
The supervisor was O. Watanabe. 

<BR>This paper by Natarajan and Sprague cites PrExt1 paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Disjoint paths in ...</A>
Nordic Journal of Computing 

<BR>This paper by Ramirez Alfonsin cites the Ramanujan paper: 
<A href="http://www.springerlink.com/content/j842l65136711702/">
Complexity of ...</A>
, Published in Combinatorica, Vol. 16.

<BR>This paper by Tuza and Voigt cites the PrExt1 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Every 2-choosable ...</A>
J. Graph Theory 22

<BR>This review by the Zentralblatt cites CMA96 paper: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:01038696&type=pdf&format=complete">
Zbl 0877.65028</A>

<BR>This review by the Zentralblatt cites the PrExt3 paper: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:00894851&type=pdf&format=complete">
Zbl 0846.05034</A>

<BR>This review by the Math. Rev. cites the CMA96 paper: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317571940985759458">
MR1373467</A>





<BR> <BR> <BR> Year 1995
<BR>

<BR>This review by Abbot cites Precoloring Extension: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
MR1270501</A>

<BR>This paper by Fouquet, Giakoumakis, Maire, and Thuillier cites the DM115 paper: 
<A href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.116">
On graphs without ...</A>
, Published in Discrete Math., Vol. 146.

<BR>This paper by Henning cites the IRREDUNDANCE(RUTCOR) paper: 
<A href="http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V00-3Y5FVF7-1D&_user=303407&_coverDate=07%2F15%2F1995&_rdoc=1&_fmt=high&_orig=search&_origin=search&_sort=d&_docanchor=&view=c&_rerunOrigin=scholar.google&_acct=C000016619&_version=1&_urlVersion=0&_userid=303407&md5=1bca0193d0eb9aaffa7676e11238d27d&searchtype=a">
Irredundance ...</A>
, Published in Discrete Math., Vol. 142.

<BR>This review by Vizvari cites the Ramanujan paper: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317571736543404994">
MR1293866</A>

<BR>This paper by Westenberger and Kallrath cites the Burkard paper:
<A href="http://math.bme.hu/~hujter/notfound.txt">
Benchmark ...</A>




<BR> <BR> <BR> Year 1994
<BR>

<BR>This thesis by Bauslaugh cites the PrExt1 paper: 
<A href="http://lib-ir.lib.sfu.ca/bitstream/1892/7872/1/b16962850.pdf">
Homeomorphisms of ...</A>

<BR>This review by Blazewitz cites the PrExt1 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">MR1308879</A>

<BR>This paper by Bodlaender, Jansen, and Woeginger cites the PrExt1, PrExt2 papers: 
<A href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.7261">
Scheduling with ...</A>

<BR>This paper by Bouza cites the DM115 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Graphes de ...</A>

<BR>This paper written in French by Bouza cites the DM115 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Graphes de permutation scindes</A>
, Published in Comptes Rendus Acad. Sci. Paris Ser. I Math., Vol. 318.

<BR>This paper by Davison cites the Ramanujan paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
On the linear ...</A>
J. Number. Theory Vol. 48

<BR>This paper by Kratochvil and Tuza cites the ... papers: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Algorithmic complexity of ...</A>

<BR>This paper by Maffray and Preissman cites the DM115 paper: 
<A href="http://math.bme.hu/~hujter/notfound.txt">
Linear recognition of ...</A>
, Published in Discrete Math., Vol. 52.

<BR>This review by the Math. Rev. cites the DM115 paper: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317571730851264530">
MR1217617</A>

<BR>This review by the Math. Rev. cites the PrExt1 paper: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317571942364696786">
MR1244124</A>





<BR> <BR> <BR> Year 1993
<BR>

<BR>This review by Abbot cites the PrExt problem: 
<A href="http://picasaweb.google.hu/Hujter.Misi/Cited#5317572103190135970">
MR1270501</A>

<BR>This paper by Bodlaender, Jansen, and Woeginger cites the PrExt1, PrExt2 papers: 
<A href="http://www.springerlink.com/content/p204886g24782558/">Scheduling with ...</A>

<BR>This paper by Cockayne and Mynhardt cites the IRREDUNDANCE paper: 
<A href="http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V00-45FKV0M-2G&_user=303407&_coverDate=11%2F15%2F1993&_rdoc=1&_fmt=high&_orig=search&_origin=search&_sort=d&_docanchor=&view=c&_searchStrId=1477125268&_rerunOrigin=scholar.google&_acct=C000016619&_version=1&_urlVersion=0&_userid=303407&md5=44aed248eeb23e53f6555b537b4e6aa7&searchtype=a">The sequence of ...</A>
, Published in Discrete Math., Vol. 122.

<BR>This paper by Kierstead and Tuza cites the PrExt1, PrExt2, PrExt3 papers:
<A href="http://math.bme.hu/~hujter/notfound.txt">Marking games and ...</A>
, Published in Graphs Combin., Vol 19.  

<BR>This paper by Kratochvil cites the PrExt1, PrExt2, PrExt3, PrExt4 papers:
<A href="http://math.bme.hu/~hujter/notfound.txt">Precoloring extension with ...</A>

<BR>This paper by Harary and Tuza cites the PrExt problem: 
<A href="http://journals.cambridge.org/action/displayFulltext?type=1&fid=4786168&jid=BAZ&volumeId=48&issueId=01&aid=4786160">Two graph-colouring games</A>

<BR>This review by Moon cites the SIAM paper: 
<A href="http://www.zentralblatt-math.org/zmath/en/search/?q=an:0783.05063&format=complete">Zbl 0783.05063</A>

<BR>This paper by Radosavljevic, Simic, and Tuza cites the DM115 paper: 
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:00205338&type=pdf&format=complete">
Complementary pairs of ...</A>
, Published in J. Comb. Math. Comb. Comput, Vol. 13.

<BR>This paper by Vizvari cites the MO32 paper: 
<A href="http://www.math.bme.hu/~hujter/vizvar93.djvu">
An application of an ...</A>

<BR>This review by the Zentralblatt cites the PrExt2 paper: 
<A href="http://www.zentralblatt-math.org/zmath/en/search/?q=an:0821.05026&format=complete">
Zbl 0821.05026</A>

<BR> <BR> <BR> Year 1992
<BR>

<BR>This paper by Bang-Jensen and Toft cites the PrExt1 paper: 
<A href="http://portal.acm.org/citation.cfm?id=133500">
Unsolved problems presented ...</A>

<BR>This paper by Biro, Simon and Tanczos cites the PrExt papers: 
<A href="http://cat.inist.fr/?aModele=afficheN&cpsidt=4640376">
Aircraft and ...</A>
, Published in J. Adv. Transp., Vol. 26.

<BR>This paper by Biro and Maros cites the PrExt papers: 
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
The use of deep ...</A>
, Published in Mittermeir (ed.), Shifting paradigms ..., Springer-Verlag.

<BR>This paper by Jansen and Scheffler cites the PrExt1,PrExt2 papers: 
<A href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.1800">
Generalized coloring for ...</A>

<BR>This paper by Kannan cites the Ramanujan paper: 
<A href="http://www.springerlink.com/content/pg07323484806745/">
Lattice translates of ...</A>






<BR> <BR> <BR> Year 1991
<BR>

<BR>This paper by Frankl and Furedi cites the MS Thesis:
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:00008160&type=pdf&format=complete">
Beyond the ...</A>

<BR>This paper by Frankl and Furedi cites the MS Thesis:
<A href="http://www.math.bme.hu/~hujter/frankl91.gif">
Beyond the ...</A>

<BR>This paper by Hedetniemi and Laskar cites the ... papers:
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
Bibliography on ...</A>
, Published in Discrete Math., Vol. 86.

<BR>This review by Mynhardt cites the irredundance(SzTAKI) paper: 
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
MR1061514</A>
 
<BR>This review by Ronyai cites the Ramanujan and the Optimization papers:
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
MR1026643</A>





<BR> <BR> <BR> Year 1990
<BR>

<BR>This review by Biro cites the ... paper:
<A href="http://portal.acm.org/citation.cfm?id=91243">
Object-oriented</A>

<BR>This review by Hedetniemi and Laskar cites the Hammer and the irredundance(RUTCOR) papers:
<A href="http://www.math.bme.hu/~hujter/hedetn90.pdf">
Bibliography on ...</A>

<BR>This review by Jayaram cites the irredundance(SzTAKI) paper: 
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
Maximum/minimum ...</A>

<BR>This review by Piehler cites the Optimization paper:
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
MR0967046</A>




<BR> <BR> <BR> Year 1989
<BR>

<BR>This review by Gaal cites the Ramanujan paper:
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
MR0945614</A>

<BR>This paper by Kannan cites the Ramanujan paper:
<A href="http://research.microsoft.com/en-us/um/people/kannan/Papers/frobenius.pdf">
Solution of the Frobenius ...</A>




<BR> <BR> <BR> Year 1988
<BR>

<BR>This paper by Bertossi and Gori cites the domination bibliograph:
<A href="http://www.cs.unibo.it/~bertossi/siamjdm.pdf">
Total domination in. ..</A>,
Published in SIAM J. Disc. Math., Vol. 1.

<BR>This paper by Hedetniemi and Laskar cites the irredundance(RUTCOR) paper: 
<A href="http://books.google.hu/books?id=zgHVZdBAezYC&pg=RA1-PA217&lpg=RA1-PA217&dq=Hujter+irredundance&source=bl&ots=IT1xI5pFYL&sig=kT0yqPqaYaAZmzUFSi1kmEH9uvw&hl=hu&ei=9Xn0Sr-8Hcf__QaPsPGvAw&sa=X&oi=book_result&ct=result&resnum=2&ved=0CAsQ6AEwAThG#v=onepage&q=Hujter%20irredundance&f=false">
Recent results and ...</A>

<BR>This paper by Sagan cites oral communication:
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
A note on independent ...</A> 




<BR> <BR> <BR> Year 1987
<BR>

<BR>This paper by Boros cites the Frobenius papers:
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:03995770&type=pdf&format=complete">
On a linear diophantine ...</A>

<BR>This paper by Frankl cites the MS thesis:
<A href="http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:04029608&type=pdf&format=complete">The shifting technique ...</A>

<BR>This paper by Vizvari cites the MO32 and MO44 papers:
<A href="http://www.math.bme.hu/~hujter/vizvar87.djvu">
An application of Gomory ...</A>




<BR> <BR> <BR> Year 1986
<BR>

<BR>This paper by Bertossi cites the irredundance(RUTCOR) and ... papers:
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
Total domination in. ..</A>

<BR>This paper by Frankl and Furedi cites the MS thesis:
<A href="http://www.math.bme.hu/~hujter/frankl86.gif">
Extremal problems ...</A>

<BR>This paper written in Magyar by Vizvari cites 
the MO43, MO44 and maximum lateness papers:
<A href="http://www.math.bme.hu/~hujter/notfound.txt">
Nehany ujabb hazai ...</A>

<BR>
<BR>
<BR> 

Complete names of the above listed authors:
<BR>
<BR> If the family name starts with letter A:
<BR> ?. Abbot
<BR> Michael O. Albertson
<BR> Vladimir E. Alekseev
<BR> Gabriela Alexe
<BR> Claudio Arbib
<BR> Esther M. Arkin
<BR> Mustapha Aouchiche
<BR> Maria Axenovich
<BR>
<BR> If the family name starts with letter B:
<BR> Gabor Bacso
<BR> Jorgen Bang-Jensen 
<BR> Gyongyi Bankuti
<BR> Agota Banyai
<BR> Tamas Jozsef Banyai 
<BR> Reneta P. Barneva
<BR> Lali Barriere 
<BR> Bruce L. Bauslaugh
<BR> Michael David Barrus 
<BR> Nelson H. F. Beebe
<BR> Nicolas Beldiceanu
<BR> Guido Berning
<BR> Alan A. Bertossi
<BR> Stephane Bessy
<BR> Evaristo Biscaia
<BR> Miklos Biro
<BR> Andreas Bjorklund
<BR> Jacek Blazewicz 
<BR> Zoltan Blazsik
<BR> F. Blomer
<BR> Yaad Blum
<BR> Marcus Brandenburg 
<BR> Valentin E. Brimkov
<BR> Philip Brisk
<BR> Hans L. Bodlaender
<BR> Flavia Bonomo
<BR> Endre Boros
<BR> A. M. Borzyszkowski
<BR> Julia Bottcher
<BR> N. Bouaza
<BR> Marcus Brandenburg
<BR> Andreas Brandstadt
<BR> Hajo Broersma
<BR> Tom C. Brown
<BR> Peter Brucker
<BR> Yuehua Bu
<BR> Jozsef Bukszar
<BR> Rainer Ernst Burkard
<BR> Jesper Makholm Byskov
<BR>
<BR> If the family name starts with letter C:
<BR> Leizhen Cai
<BR> Leocadio G. Casado
<BR> M. Cecowski
<BR> Jaime Cerda
<BR> Gerard Jennhwa Chang
<BR> Sheshayya A. Choudum
<BR> Janka Chlebikova
<BR> Miroslav Chlebik
<BR> Wun-Seng Chou
<BR> Vasek Chvatal
<BR> Iwona Cieslik
<BR> Mihai Cipu 
<BR> Ernest J. Cockayne 
<BR> Amin Coja-Oghlan
<BR> Jozsef Cselenyi
<BR> Tibor Csendes
<BR> Erzsebet Csuhaj-Varju
<BR> Bela Csukas
<BR> Julius Czap
<BR>
<BR> If the family name starts with letter D:
<BR> Aleksandr Borisovich Dainiak
<BR> Luca Dall'Asta
<BR> Simone Dantas de Souza
<BR> Andrea Darabos
<BR> J. L. Davison
<BR> Rita de Brito Alves 
<BR> Celina Miraglia Herrera de Figueiredo
<BR> Dominique de Werra 
<BR> Marc Demange
<BR> Dariusz Dereniowski
<BR> Claudio Oller do Nascimento 
<BR> Klaus Dohmen
<BR> Feng-Ming Dong
<BR> Guillermo Duran
<BR>
<BR> If the family name starts with letter E:
<BR> Martin R. Ehmsen
<BR> Andreas Eisenblatter 
<BR> Tinaz Ekim
<BR> N. M. Elango
<BR> Thomas Emden-Weinert
<BR> Konrad Engel
<BR> S. Engell
<BR> Jessica Enright
<BR> Zoltan Eory
<BR> Leah Epstein
<BR> Ferenc Erdelyi
<BR> Thomas Erlebach
<BR> Bruno Escoffier 
<BR> Zoltan Esik
<BR> Guy Even
<BR>
<BR> If the family name starts with letter F:
<BR> Zoltan Fabulya
<BR> Marco Fahl
<BR> Martin Farber
<BR> Yuri Faenza 
<BR> Michael Fellows
<BR> Jiri Fiala
<BR> Fedor V. Fomin
<BR> Thomas H. Foregger 
<BR> Tiziana Fortuna
<BR> Jean-Luc Fouquet
<BR> Tom Friedetzky
<BR> Hanna Furmanczyk 
<BR> Peter Frankl
<BR> Katalin Friedl
<BR> Tobias Friedlich
<BR> Zoltan Furedi
<BR>
<BR> If the family name starts with letter G:
<BR> Istvan Gaal 
<BR> Aurel Galantai 
<BR> Philippe Galinier
<BR> Inmaculada Garcia
<BR> Naveen Garg
<BR> Zsolt Gaspar
<BR> Serge Gaspers
<BR> Michael C. Georgiadis
<BR> Michel U. Gerber 
<BR> Dieter Gernert 
<BR> Vassilis Giakoumakis 
<BR> C. Y. Goh 
<BR> Petr A. Golovach
<BR> Gerhard Goos
<BR> Alessandro Gori
<BR> Joanna Gorska
<BR> Sylvain Gravier
<BR> Ignacio E. Grossmann
<BR> Martin Grotschel
<BR> Daniel Grund
<BR> Miklos Guban
<BR> H. O. Gunther
<BR> Korhan Gursoy
<BR> Venkatesan Guruswami
<BR> Richard K. Guy
<BR> Andras Gyarfas
<BR>
<BR> If the family name starts with letter H:
<BR> Sebastian Hack
<BR> Gena Hahn
<BR> Veronika Halasz
<BR> Peter Laszlo Hammer
<BR> Pierre Hansen
<BR> Teresa W. Haynes
<BR> Jin­Kao Hao
<BR> Frank Harary
<BR> Iiro Harjunkoski 
<BR> Stephen G. Hartke 
<BR> Juris Hartmanis
<BR> Stephan Hartmann 
<BR> Refael Hassin
<BR> Hamed Hatami
<BR> Johannes Hatzl
<BR> Teresa W. Hayes
<BR> Agnes Havasi
<BR> Frederic Havet
<BR> Wansheng He
<BR> Stephen T. Hedetniemi 
<BR> Pinar Heggernes 
<BR> Silvia Heitman
<BR> Pavol Hell
<BR> Michael A. Henning
<BR> Rene Henrion 
<BR> Danny Hermelin
<BR> Alain Hertz
<BR> Chinh T. Hoang
<BR> Yaoping Hou
<BR> Stefan Hougardy
<BR> Hongbo Hua
<BR> Johann Hurink
<BR> Cor A. J. Hurkens
<BR> Thore Husfeldt
<BR> Joan P. Hutchinson
<BR>
<BR> If the family name starts with letter I:
<BR> Pawel M. Idziak
<BR> Paolo Ienne
<BR> Liviu Ilinca
<BR> Bela Illes
<BR> Tibor Illes 
<BR> G. Isaak
<BR> Antal Ivanyi
<BR>
<BR> If the family name starts with letter J:
<BR> R. Jamison
<BR> Bart M. P. Jansen
<BR> Klaus Jansen
<BR> S. R. Jayaram
<BR> Zemin Jin
<BR> Vincent Jost
<BR> Min-Jen Jou
<BR>
<BR> If the family name starts with letter K:
<BR> Jeff Kahn
<BR> Josef Kallrath
<BR> Ravi Kannan
<BR> Yoshiyuki Karuno
<BR> M. Kumbhat
<BR> Hal A. Kierstead 
<BR> Geza Kiss
<BR> Ottmar Kladiva
<BR> Bettina Klinz
<BR> Sigrid Knust
<BR> K. M. Koh 
<BR> Antoon W. J. Kolen
<BR> Rainer Kolisch
<BR> Georgios M. Kopanos
<BR> Dmitry V. Korobitsyn
<BR> Arie M. C. A. Koster 
<BR> Jakob Krarup
<BR> Jan Kratochvil
<BR> Stefan Kratsch
<BR> Adrian Kosowski
<BR> Peter Kortesi
<BR> Dieter Kratsch
<BR> D. Kreuter
<BR> Bala Krishnamoorthy
<BR> S. Krishnamurthi
<BR> Wieslaw Kubiak
<BR> Harol W. Kuhn
<BR> Mohit Kumbhat 
<BR> Jurgen S. Kussi, 
<BR>
<BR> If the family name starts with letter L:
<BR> Renu C. Laskar
<BR> Kim Skak Larsen
<BR> Michelle A. Lastrina
<BR> Hoong Chuin Lau
<BR> Benoit Laurent
<BR> Jonathan Kenneth Lee
<BR> Jan van Leeuwen
<BR> Jan Karel Lenstra
<BR> Benjamin Leveque
<BR> Van Bang Le
<BR> Asaf Levin
<BR> Lifen Li
<BR> Xueliang Li
<BR> Xiaoying Liang 
<BR> Mathieu Liedloff
<BR> Andrew Lim
<BR> Jiuqiang Liu
<BR> Xuezi Liu
<BR> Daniel Lokshtanov
<BR> Zbigniew Lonc
<BR> Vadim V. Lozin
<BR> Mingzhe Lu
<BR>
<BR> If the family name starts with letter M:
<BR> Frederic Maffray
<BR> Nadimpalli V. R. Mahadev
<BR> Suhail Mahfud
<BR> Frederic Maire
<BR> Ewa Malesinska
<BR> Dmitriy Malyshev
<BR> Frederico Mancini 
<BR> Gordana Manic
<BR> David Francis Manlove
<BR> Javier Marenco
<BR> A. Markert
<BR> Mihaly Csaba Markot
<BR> Istvan Maros
<BR> Daniel Marx
<BR> Vipul Mehta
<BR> Carlos A. Mendez
<BR> Alexandra Eva Meszaros
<BR> Martin Milanic
<BR> Alicia Miralles
<BR> R. Mittermeir
<BR> Bojan Mohar
<BR> Rollf H. Mohring
<BR> Jerome Monnot
<BR> J. W. Moon 
<BR> Emily H. Moore
<BR> Gregory Morel
<BR> Raffaele Mosca
<BR> Haiko Muller
<BR> Christine M. Mynhardt
<BR>
<BR> If the family name starts with letter N:
<BR> Judit Nagy-Gyorgy
<BR> Jim Nastos
<BR> Sridhar Natarajan
<BR> Nina Narodytska
<BR> Zsolt Nemeth
<BR> K. Neumann
<BR> Jaroslav Nesetril
<BR> Jesper Makholm Nielsen
<BR>
<BR> If the family name starts with letter O:
<BR> E. Ochmanski
<BR> M. Odersky
<BR> Bela Olah
<BR> Sabine Ohring
<BR> Chihiro Omi
<BR> Gianpaolo Oriolo
<BR> Carmen Ortiz 
<BR> Robert W. Owens
<BR>
<BR> If the family name starts with letter P:
<BR> Jerome Palaysi
<BR> Jens Palsberg
<BR> Christos H. Papadimitriou
<BR> Marina Papatriantafilou 
<BR> Sandrine Paroz
<BR> Vangelis Th. Paschos
<BR> Gabor Pataki
<BR> Daniel Paulusma
<BR> Anders Sune Pedersen
<BR> Fernando Magno Quintao Pereira
<BR> Gilles Pesant
<BR> Ken Peters
<BR> Joachim Piehler
<BR> Paolo Pin
<BR> Andras Pluhar
<BR> Emmanuel Poder
<BR> Laszlo Pokoradi
<BR> Stefan Porschen
<BR> Myriam Preissmann
<BR> Andrzej Proskurowski
<BR> Hans Jurgen Promel
<BR> Luis Puigjaner
<BR>
<BR> If the family name starts with letter Q:
<BR> Yilian Qin
<BR> Ruzayn Quaddoura
<BR>
<BR> If the family name starts with letter R:
<BR> Landon Rabern
<BR> Tom Racham
<BR> Zoran Radosavljevic
<BR> Venkatesh Raman
<BR> Abolfazl Ramezanpour
<BR> Jorge L. Ramirez Alfonsin 
<BR> Bruce A. Reed
<BR> Eric Remy 
<BR> Shengzhang Ren
<BR> Bernard Ries 
<BR> H. N. de Ridder
<BR> Richard D. Ringeisen
<BR> Fred S. Roberts
<BR> Leonardo Sampaio Rocha
<BR> Werner Romisch
<BR> Lajos Ronyai
<BR> Frances Rosamond
<BR> Jeffrey S. Rosenschein
<BR> Bernard Roy
<BR> Shlomi Rubinstein
<BR> Rudiger Rudolf
<BR> Irena C. Rusu
<BR>
<BR> If the family name starts with letter S:
<BR> Claudia Linhares Sales 
<BR> Bruce E. Sagan 
<BR> Leonardo Sampaio
<BR> G. Sand 
<BR> Eric Sanlaville
<BR> Edit Santane-Toth
<BR> Saket Saurabh
<BR> Shimon Sharar
<BR> Petra Scheffler
<BR> Peter Schoner
<BR> Alexander Schrijver
<BR> Rudiger Schultz
<BR> Egon Schulte
<BR> Christoph Schwindt
<BR> Andras Sebo
<BR> Yuan-xia Sha
<BR> A. Shalom
<BR> Valery N. Shevchenko
<BR> S. G. Shirinivas
<BR> Peter Jau-shyong Shiue
<BR> Somnath Sikdar
<BR> Zoltan Simenfalvi 
<BR> Slobodan Simic
<BR> Istvan Simon
<BR> Zdzislaw Skupien
<BR> Peter J. Slater
<BR> N. J. A. Sloane
<BR> S. A. Sokolowski
<BR> Eckard Specht
<BR> Ewald Speckenmeyer
<BR> Frits C. R. Spieksma
<BR> Jeremy P. Spinrad
<BR> Laszlo Spissich
<BR> Alan P. Sprague
<BR> Anand Srinastav
<BR> Yonutz V. Stanchescu
<BR> Rob van Stee
<BR> Angelica Steger
<BR> Eleonora Stettner
<BR> Lorna Stewart
<BR> Maxim Sviridenko
<BR> Barna Szabo
<BR> Peter Szabo
<BR> Peter Gabor Szabo
<BR> Balazs Szalkai
<BR> Istvan Szalkai
<BR> Tamas Szantai
<BR> Gyorgy Szeidl
<BR> Laszlo Szeidl 
<BR> Jeno Szigeti
<BR>
<BR> If the family name starts with letter T:
<BR> Shun-Ho Tai
<BR> Yasuhiko Takenaga
<BR> C. Tanczos 
<BR> Anusch Taraz
<BR> Tibor Tarnai
<BR> Tomoaki Tachibana
<BR> Edouard Thiel
<BR> Henri Thuillier
<BR> A. G. Thomasson 
<BR> Krisztian Tichler
<BR> Bjarne Toft
<BR> Franz-Josef Tolle
<BR> Gyula Toth
<BR> Tibor Toth
<BR> Norbert Trautmann
<BR> Richard Trefler
<BR> Amitabha Tripathi
<BR> Nicolas Trotignon 
<BR> Miroslaw Truszczynski
<BR> Philippas Tsigas
<BR> Zsolt Tuza
<BR> J. Tyszkiewicz
<BR>
<BR> If the family name starts with letter U:
<BR> Miklos Ujvari
<BR>
<BR> If the family name starts with letter V:
<BR> Richard Vahrenkamp
<BR> Maarten H. van der Vlerk
<BR> Preben Dahl Vestergaard
<BR> S. Vetrivel
<BR> Ajay K. Verma
<BR> Monica Villanueva
<BR> Bela Vizvari
<BR> Margit Voigt
<BR> Lutz Volkmann
<BR> Vitaly I. Voloshin
<BR>
<BR> If the family name starts with letter W:
<BR> Dorothea Wagner
<BR> Osamu Watanabe
<BR> Eric W. Weisstein
<BR> Marc Wennink
<BR> Douglas B. West
<BR> H. Westenberger
<BR> Gerhard J. Woeginger
<BR> Guy Wolfovitz
<BR> David R. Wood
<BR>
<BR> If the family name starts with letter X:
<BR> Zhi Xu
<BR>
<BR> If the family name starts with letter Y:
<BR> Akihiro Yamada
<BR> Kougaku Yamashita
<BR> Sherry H. F. Yan
<BR>
<BR> If the family name starts with letter Z:
<BR> Libing Zhang 
<BR> Peipei Zhu
<BR> Igor Ed. Zverovich
<BR> Inessa I. Zverovich
<BR> Vadim Zverovich
<BR> Pawel Zylinski