0 projects

Date from new to old

FRIPRO-Fri prosjektstøtte

Beyond Worst-Case Analysis in Algorithms

Moderne teoretisk datavitenskap står overfor en grunnleggende utfordring: nåværende metoder klarer ikke å forklare effektiviteten til moderne maskinlæringsalgoritmer. For å forsone algoritmisk utilgjengelighet med maskinlæring vil vi utvikle nyskapende algoritmiske og kompleksitetsmetoder, med må...

Awarded: NOK 12.0 mill.

Project Period: 2021-2027

Location: Vestland

IS-AUR-Samarb.progr. mellom Norge og Frankrike

Beyond-P: Algorithm Design and Analysis Beyond the Polynomial Time

Each team will involve 4 members to the proposal, among them 3 PhD students and 1 permanen researcher (8 researchers in total). From the LIRMM-team the students will be Lucas Isenmann, Abhijat Sarma, and Jocelyn Thiebaut, while from the UOB-team the students will be Kristine Vitting Klinkby Knuds...

Awarded: NOK 75,000

Project Period: 2019-2019

Location: Vestland

FRINATEK-Fri prosjektstøtte for matematikk, naturvitenskap og teknologi

Multivariate Algorithms: New domains and paradigms

Formålet med prosjektet er å drive grunnforskning i informatikk og informasjonsteknologi, spesifikt innen algoritmer og kompleksitet. Teoretisk informatikk står ovenfor en grunnleggende utfordring: effektivitets-estimater utledet ved hjelp av teoretiske modeller sammenfaller dårlig med faktiske e...

Awarded: NOK 10.0 mill.

Project Period: 2017-2021

Location: Vestland

IS-MOBIL-Mobilitetsprogr.f.utl.Ph.D-stu

Finding maximum subgraphs Research visit of Ivan Bliznets - Russia

The funding sought is for a research stay of Ivan Bliznets, a PhD student from St. Petersburg Academic University of the RAS, Russia, at the Algorithms Research Group at the University of Bergen. The duration of the stay is 3 months.

Awarded: NOK 42,000

Project Period: 2013-2013

Location: Vestland

IS-AUR-Samarb.progr. mellom Norge og Frankrike

Enumeration using structure: algorithms and complexity

Enumeration is at the heart of exact complexity. The following question was already asked in 1956 by Kurt Gödel in a famous letter to John van Neumann: "It would be interesting to know, ... how strongly in general the number of steps in finite combinatori al problems can be reduced with respect t...

Awarded: NOK 60,295

Project Period: 2013-2013

Location: Vestland

IS-DAAD-Forskerutveksling Norge-Tyskland

Kernels, Protrusions, and Graph Minors

The project aims to establish long term research collaboration between Algorithms groups from Bergen and Aachen. The topic of collaboration is on Parameterized Algorithms and Complexity, Kernelization and Graph Algoruthms.

Awarded: NOK 54,517

Project Period: 2013-2015

Location: Vestland

FRINATEK-Fri prosjektstøtte for matematikk, naturvitenskap og teknologi

Network Searching: New Foundational Directions

Networks, especially modern day communication networks, are often targets of malicious agents. An important challenge of research in ICT is to provide a foundational framework within which on one hand the capabilities of the malicious agents will be asse ssed in various contexts and cases, and o...

Awarded: NOK 5.6 mill.

Project Period: 2008-2012

Location: Vestland

IS-DAAD-Forskerutveksling Norge-Tyskland

Fomin, Fedor DAADppp 2008-09 Tysk-norsk forskerutveksling

...

Awarded: NOK 63,823

Project Period: 2008-2010

Location: Vestland

INT-BILAT-BILAT-ordningen

Canada---bilateral cooperation on ``Network Searching: Theory and Applications"

See the attached project description.

Awarded: NOK 0.14 mill.

Project Period: 2007-2007

Location: Vestland

F-INF-Naturvitenskap, informatikk

Organizing the annual international workshop WG 2006 in Bergen

The Algorithms Research Group at the Department of Informatics, University of Bergen, is organizing WG 2006 - 32nd International Workshop on Graph-Theoretic Concepts in Computer Science. This is one of the main international events in the graph algorit hms research society, and it is eagerly a...

Awarded: NOK 0.10 mill.

Project Period: 2006-2006

Location: Vestland

YFF-Yngre, fremragende forskere

Coping with the NP-hardness: Parameterized and exact algorithms

The seminal observations from the late 1960s that many computational problems did not seem to have any efficient algorithm and could therefore not be solved in practice, has continued to guide the field of algorithms and computational complexity. Several methods for dealing with NP-hard problem...

Awarded: NOK 7.8 mill.

Project Period: 2005-2010

Location: Vestland

IS-AUR-Samarb.progr. mellom Norge og Frankrike

Fomin, F Aur05-9: 60000 Tildelt for 04 (03-budsj): 60000

...

Awarded: NOK 60,000

Project Period: 2004-2005

Location: Vestland

F-INF-Naturvitenskap, informatikk

Exact Algorithms for Hard Problems

...

Awarded: NOK 5.3 mill.

Project Period: 2004-2008

Location: Vestland