929:
22:
258:
2020: Daniel Marx, Jianer Chen, Yang Liu, Songjian Lu, Barry O’Sullivan, Igor Razgon, for inventing the concepts of important separators and cuts which have become elegant and efficient tools used to establish the fixed parameter tractability of graph
534:
135:
530:
686:
660:
584:
486:
437:
389:
339:
131:
724:
913:
995:
431:
383:
966:
985:
288:
2023: Marek Cygan, Jesper
Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, and Jakub Onufry Wojtaszczyk for their paper
906:
229:, Fabrizio Grandoni, and Dieter Kratsch, for developing the "measure and conquer" method for the analysis of backtracking algorithms.
105:
208:, defining a broad framework for the design of fixed-parameter-tractable algorithms for domination and covering problems on graphs.
43:
36:
578:
990:
680:
654:
480:
710:
313:
159:
86:
899:
717:
185:, proving that several problems with fixed-parameter tractable algorithms do not have polynomial-size kernels unless the
58:
1000:
959:
879:
123:
155:
65:
282:
32:
220:
127:
72:
952:
457:
606:
278:
216:
54:
263:
237:
186:
784:
746:
201:
151:
158:
and using it to determine the exact parameterized complexity of several important variants of the
755:
166:
630:
299:, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, and Dimitrios M. Thilikos for their paper
936:
883:
154:, Valentine Kabanets, Ramamohan Paturi, and Francis Zane, for their research formulating the
205:
838:
763:
274:
255:
technique, a vastly important ingredient in the toolbox of parameterized algorithm design.
174:
79:
979:
767:
182:
178:
631:"NUS Computing professors Sanjay Jain and Frank Stephan win EATCS-IPEC Nerode Prize"
776:
290:
Solving
Connectivity Problems Parameterized by Treewidth in Single Exponential Time
267:
252:
193:
359:
799:
780:
296:
226:
197:
21:
928:
410:
759:
170:
462:, University of Maryland Institute for Advanced Computer Studies, May 8, 2015
818:
814:
248:
244:
556:
507:
333:
262:
2021: C. S. Calude, S. Jain, B. Khoussainov, W. Li, F. Stephan, for their
702:
233:
846:
Cygan, Nederlof, Pilipczuk, Pilipczuk, van Rooij, Onufry
Wojtaszczyk
607:"Ireland's Prof Barry O'Sullivan wins global computer science award"
706:
232:
2018: Stefan
Kratsch and Magnus Wahlström for their work using
136:
International
Symposium on Parameterized and Exact Computation
15:
852:
Bodlaender, Fomin, Lokshtanov, Penninkx, Saurabh, Thilikos
281:
on the fixed-parameter tractability of graph properties in
940:
887:
126:
prize awarded for outstanding research in the area of
687:
661:
585:
487:
438:
390:
European Association for Theoretical Computer Science
340:
European Association for Theoretical Computer Science
132:
European Association for Theoretical Computer Science
531:"Magnus Wahlström was awarded the 2018 Nerode Prize"
138:. The prize was offered for the first time in 2013.
204:, and Dimitrios Thilikos, for their research on
561:, Helsinki Institute for Information Technology
219:lead to a significantly improved algorithm for
236:theory to develop polynomial-size kernels for
960:
907:
718:
213:Determinant Sums for Undirected Hamiltonicity
8:
967:
953:
914:
900:
725:
711:
703:
411:"Academic wins international maths prize"
181:, and Rahul Santhanam, for their work on
106:Learn how and when to remove this message
826:Marx, Chen, Liu, Lu, O’Sullivan, Razgon
832:Calude, Jain, Khoussainov, Li, Stephan
433:EATCS-IPEC Nerode Prize 2014 - Laudatio
385:EATCS-IPEC Nerode Prize 2013 - Laudatio
325:
211:2016: Andreas Björklund for his paper
42:Please improve this article by adding
537:from the original on January 25, 2022
7:
925:
923:
867:
865:
146:The prize winners so far have been:
409:Nelson, Patrick (October 6, 2014).
996:Theoretical computer science stubs
939:. You can help Knowledge (XXG) by
886:. You can help Knowledge (XXG) by
14:
935:This science awards article is a
459:Hajiaghayi Wins 2015 Nerode Prize
927:
215:, showing that methods based on
20:
314:List of computer science awards
512:, ALGO 2017, September 3, 2017
160:Boolean satisfiability problem
1:
605:Darmody, Jenny (2020-12-16).
44:secondary or tertiary sources
986:Theoretical computer science
880:theoretical computer science
682:EATCS-IPEC Nerode Prize 2024
656:EATCS-IPEC Nerode Prize 2023
580:EATCS-IPEC Nerode Prize 2019
482:EATCS-IPEC Nerode Prize 2016
124:theoretical computer science
156:exponential time hypothesis
1017:
922:
864:
558:ALGO 2018 keynote speakers
295:2024: Hans L. Bodlaender,
283:monadic second-order logic
221:finding Hamiltonian cycles
749:, Kabanets, Paturi, Zane
741:
360:"EATCS-IPEC Nerode Prize"
128:multivariate algorithmics
364:Parameterized Complexity
991:Computer science awards
266:algorithm for deciding
130:. It is awarded by the
120:EATCS–IPEC Nerode Prize
882:–related article is a
247:, Raphael Yuster, and
217:algebraic graph theory
31:relies excessively on
240:and related problems.
238:odd cycle transversal
150:2013: Chris Calabro,
802:, Grandoni, Kratsch
301:(Meta) Kernelization
264:quasipolynomial time
251:, for inventing the
187:polynomial hierarchy
1001:Science award stubs
808:Kratsch, Wahlström
587:, September 3, 2019
279:Courcelle's theorem
202:Mohammad Hajiaghayi
152:Russell Impagliazzo
177:, Danny Hermelin,
175:Michael R. Fellows
167:Hans L. Bodlaender
948:
947:
895:
894:
862:
861:
855:
849:
843:
835:
829:
823:
811:
805:
796:
790:
773:
752:
489:, August 29, 2016
335:IPEC Nerode Prize
116:
115:
108:
90:
1008:
969:
962:
955:
931:
924:
916:
909:
902:
871:P ≟ NP
866:
853:
847:
841:
833:
827:
821:
809:
803:
794:
788:
771:
750:
727:
720:
713:
704:
697:
695:
694:
693:
677:
671:
669:
668:
667:
651:
645:
644:
642:
641:
627:
621:
620:
618:
617:
611:Silicon Republic
602:
596:
594:
593:
592:
575:
569:
568:
567:
566:
553:
547:
546:
544:
542:
533:. May 13, 2018.
527:
521:
519:
518:
517:
504:
498:
496:
495:
494:
477:
471:
469:
468:
467:
454:
448:
446:
445:
444:
428:
422:
421:
419:
417:
406:
400:
398:
397:
396:
380:
374:
372:
371:
370:
356:
350:
348:
347:
346:
330:
206:bidimensionality
171:Rodney G. Downey
111:
104:
100:
97:
91:
89:
48:
24:
16:
1016:
1015:
1011:
1010:
1009:
1007:
1006:
1005:
976:
975:
974:
973:
921:
920:
873:
863:
858:
737:
731:
701:
700:
691:
689:
679:
678:
674:
665:
663:
653:
652:
648:
639:
637:
629:
628:
624:
615:
613:
604:
603:
599:
590:
588:
577:
576:
572:
564:
562:
555:
554:
550:
540:
538:
529:
528:
524:
515:
513:
506:
505:
501:
492:
490:
479:
478:
474:
465:
463:
456:
455:
451:
442:
440:
430:
429:
425:
415:
413:
408:
407:
403:
394:
392:
382:
381:
377:
368:
366:
358:
357:
353:
344:
342:
332:
331:
327:
322:
310:
275:Bruno Courcelle
144:
112:
101:
95:
92:
49:
47:
41:
37:primary sources
25:
12:
11:
5:
1014:
1012:
1004:
1003:
998:
993:
988:
978:
977:
972:
971:
964:
957:
949:
946:
945:
932:
919:
918:
911:
904:
896:
893:
892:
875:
869:
860:
859:
857:
856:
850:
844:
836:
830:
824:
812:
806:
797:
791:
774:
753:
742:
739:
738:
732:
730:
729:
722:
715:
707:
699:
698:
672:
646:
622:
597:
570:
548:
522:
499:
472:
449:
423:
401:
375:
351:
324:
323:
321:
318:
317:
316:
309:
306:
305:
304:
297:Fedor V. Fomin
293:
286:
271:
260:
256:
241:
230:
227:Fedor V. Fomin
223:
209:
198:Fedor V. Fomin
190:
163:
143:
140:
114:
113:
55:"Nerode Prize"
28:
26:
19:
13:
10:
9:
6:
4:
3:
2:
1013:
1002:
999:
997:
994:
992:
989:
987:
984:
983:
981:
970:
965:
963:
958:
956:
951:
950:
944:
942:
938:
933:
930:
926:
917:
912:
910:
905:
903:
898:
897:
891:
889:
885:
881:
876:
872:
868:
851:
845:
840:
837:
831:
825:
820:
816:
813:
807:
801:
798:
792:
786:
782:
778:
775:
769:
765:
761:
757:
754:
748:
744:
743:
740:
735:
728:
723:
721:
716:
714:
709:
708:
705:
688:
684:
683:
676:
673:
662:
658:
657:
650:
647:
636:
635:NUS Computing
632:
626:
623:
612:
608:
601:
598:
586:
582:
581:
574:
571:
560:
559:
552:
549:
536:
532:
526:
523:
511:
510:
503:
500:
488:
484:
483:
476:
473:
461:
460:
453:
450:
439:
435:
434:
427:
424:
412:
405:
402:
391:
387:
386:
379:
376:
365:
361:
355:
352:
341:
337:
336:
329:
326:
319:
315:
312:
311:
307:
302:
298:
294:
291:
287:
284:
280:
276:
272:
269:
265:
261:
257:
254:
250:
246:
242:
239:
235:
231:
228:
224:
222:
218:
214:
210:
207:
203:
199:
195:
191:
188:
184:
183:kernelization
180:
179:Lance Fortnow
176:
172:
168:
164:
161:
157:
153:
149:
148:
147:
141:
139:
137:
133:
129:
125:
121:
110:
107:
99:
88:
85:
81:
78:
74:
71:
67:
64:
60:
57: –
56:
52:
51:Find sources:
45:
39:
38:
34:
29:This article
27:
23:
18:
17:
941:expanding it
934:
888:expanding it
877:
870:
770:, Santhanam
766:, Hermelin,
734:Nerode Prize
733:
690:, retrieved
681:
675:
664:, retrieved
655:
649:
638:. Retrieved
634:
625:
614:. Retrieved
610:
600:
589:, retrieved
579:
573:
563:, retrieved
557:
551:
539:. Retrieved
525:
514:, retrieved
508:
502:
491:, retrieved
481:
475:
464:, retrieved
458:
452:
441:, retrieved
432:
426:
414:. Retrieved
404:
393:, retrieved
384:
378:
367:, retrieved
363:
354:
343:, retrieved
334:
328:
300:
289:
268:parity games
253:Color-coding
212:
194:Erik Demaine
145:
119:
117:
102:
93:
83:
76:
69:
62:
50:
30:
817:, Yuster,
787:, Thilikos
747:Impagliazzo
541:November 1,
416:November 1,
980:Categories
793:Björklund
785:Hajiaghayi
756:Bodlaender
692:2024-09-06
666:2024-01-18
640:2022-11-01
616:2022-11-01
591:2020-01-01
565:2018-08-24
516:2017-09-03
493:2016-08-29
466:2015-09-03
443:2015-09-03
395:2015-09-03
369:2015-09-03
345:2015-09-03
320:References
189:collapses.
66:newspapers
33:references
839:Courcelle
745:Calabro,
736:laureates
509:ALGO 2017
259:problems.
249:Uri Zwick
245:Noga Alon
535:Archived
308:See also
134:and the
96:May 2013
777:Demaine
768:Fortnow
764:Fellows
234:matroid
142:Winners
80:scholar
874:
854:(2024)
848:(2023)
842:(2022)
834:(2021)
828:(2020)
822:(2019)
810:(2018)
804:(2017)
795:(2016)
789:(2015)
772:(2014)
760:Downey
751:(2013)
273:2022:
243:2019:
225:2017:
192:2015:
165:2014:
82:
75:
68:
61:
53:
878:This
819:Zwick
800:Fomin
781:Fomin
122:is a
87:JSTOR
73:books
937:stub
884:stub
815:Alon
543:2022
418:2022
277:for
118:The
59:news
35:to
982::
783:,
779:,
762:,
758:,
685:,
659:,
633:.
609:.
583:,
485:,
436:,
388:,
362:,
338:,
200:,
196:,
173:,
169:,
46:.
968:e
961:t
954:v
943:.
915:e
908:t
901:v
890:.
726:e
719:t
712:v
696:.
670:.
643:.
619:.
595:.
545:.
520:.
497:.
470:.
447:.
420:.
399:.
373:.
349:.
303:.
292:.
285:.
270:.
162:.
109:)
103:(
98:)
94:(
84:·
77:·
70:·
63:·
40:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
