- INFORMATICS ISSN 0333-3590
- INFORMATICS ISSN 0333-3590
- The complexity of approximating the oriented diameter of chordal graphs
- INFORMATICS ISSN 03333590
- Secure Heterogeneous Information Presentation (heterogeneous contents on heterogeneous platforms)
- Optimal Linear Arrangement of Interval Graphs Johanne Cohen1
- Note on a helicopter search problem on Fedor V. Fomin
- Cutwidth of split graphs and threshold graphs Pinar Heggernes
- Interval degree and bandwidth of a graph ? Fedor V. Fomin 1
- On the Domination Search Number ? Fedor V. Fomin
- manuscript No. (will be inserted by the editor)
- How to get t Anogia From Heraklion the drive is wonderful, winding mountain roads, passing through
- Counting Subgraphs via Homomorphisms Fedor V. Fomin
- Spanners in sparse graphs Feodor F. Dragan
- Combinatorial Bounds via Measure and Conquer: Bounding Minimal Dominating Sets and
- Approximation algorithms for time-dependent orienteering
- GRAPH SEARCHING AND INTERVAL COMPLETION FEDOR V. FOMIN AND PETR A. GOLOVACH y
- A parameterized algorithm for Chordal Sandwich Pinar Heggernes
- On the Directed Degree-Preserving Spanning Tree Problem Daniel Lokshtanov1, Venkatesh Raman2, Saket Saurabh1, and Somnath Sikdar2
- INFORMATICS ISSN 0333-3590
- Exact algorithms for treewidth and minimum fill-in Fedor V. Fomin
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- INFORMATICS ISSN 0333-3590
- INFORMATICS ISSN 0333-3590
- How to Guard a Graph? Fedor V. Fomin
- INFORMATICS ISSN 0333-3590
- INFORMATICS ISSN 0333-3590
- Discrete Applied Mathematics 141 (2004) 135148 www.elsevier.com/locate/dam
- INF210. Typical items to discuss at the oral exam
- Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
- Subexponential Algorithms for Partial Cover Problems Fedor V. Fomin
- INFORMATICS ISSN 0333-3590
- INFORMATICS ISSN 0333-3590
- New Technique for Solving Sparse Equation Systems Hvard Raddum and Igor Semaev
- Pathwidth of planar and line graphs Fedor V. Fomin
- Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments We present a fast local search algorithm that finds an
- INFORMATICS ISSN 0333-3590
- Minimal interval completions Pinar Heggernes1, Karol Suchan2, Ioan Todinca2, and Yngve Villanger1
- E cient Implementation of a Minimal Triangulation Algorithm
- Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
- Bandwidth on AT-free graphs Petr Golovach1 Pinar Heggernes1 Dieter Kratsch2
- On the Monotonicity of Games Generated by Symmetric Submodular Functions
- Planar graph coloring with forbidden subgraphs: Why trees and paths are dangerous
- Search problems on 1-skeletons of regular polyhedrons
- Approximating minimum cocolourings Fedor V. Fomin ?1 , Dieter Kratsch 2 , and JeanChristophe Novelli 3
- The beamer class Manual for version 3.06.
- Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments Fedor V. Fomin and Daniel Lokshtanov
- Computing the cutwidth of bipartite permutation graphs in linear time
- INFORMATICS ISSN 0333-3590
- A 3-approximation for the pathwidth of Halin Fedor V. Fomin
- INFORMATICS ISSN 0333-3590
- Intractability of Clique-width Parameterizations
- Pursuing Fast Robber in Graph Fedor V. Fomin
- Algorithms for graphs with small octopus # Fedor V. Fomin
- Helicopter search problems, bandwidth and pathwidth Department of Operations Research, Faculty of Mathematics and Mechanics,
- An annotated bibliography on guaranteed graph searching
- Fedor V. Fomin 9 List of Publications
- Generalized graph clustering: recognizing (p, q)-cluster graphs Pinar Heggernes
- Foundations of Software Technology and Theoretical Computer Science (2011) Submission Obtaining a bipartite graph by
- An Exact Algorithm for Minimum Distortion Embedding Fedor V. Fomin
- Subexponential Algorithms for Partial Cover Problems Fedor V. Fomin
- Cops and Robber Game Without Recharging Fedor V. Fomin
- Contracting graphs to paths and trees Pinar Heggernes1
- Daniel Lokshtanov2 Saket Saurabh2
- Minimal split completions # Pinar Heggernes + Federico Mancini +
- Dynamically maintaining split graphs Pinar Heggernes y Federico Mancini y
- The Seventh Biennial SCANDINAVIAN
- Rektor Sigmund Grnmos tale ved pningen av det akademiske ret p Universitetet i Bergen, 16. august 2011.
- The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
- Nordic Network of Narrative Studies Narrative Ethics, Friday 19 Saturday 20 November 2010
- Dokumentasjon av engelskkunnskaper Ved gjennomgangen av de enkelte lands utdanninger, er nivet i engelsk vurdert spesielt. For hvert
- Kernelization hardness of connectivity problems Michal Pilipczuk
- Improved Algorithms for the Feedback Vertex Set Problems
- 09.00 pning ved professor Knut Matre, Institutt for indremedisin 09.05 Ureteroskopi med og uten safety guidewire
- Foundations of Software Technology and Theoretical Computer Science (2011) Submission Obtaining a bipartite graph by
- INFORMATIKK Nr. 21 2. november 2009
- THE DEPARTMENT OF INFORMATICS NO. 1 2012
- INFORMATIKK Nr. 21 28. september 2007
- Mte om datalagringsdirektivet Tid for FRITEK og FRINAT fr NFR
- Curriculum Vitae Yngve Villanger
- Security API for Java ME: secureXdata Remi Andr B. Valvik
- Feedback Vertex Set in Mixed Graphs Paul Bonsma1
- INFORMATIKK Nr. 12 26. april 2010
- Ikke gjr deg dummere enn du er! Gudmund Hernes
- Framdriftsrapport. Rapporteringsfrist: 20111001. Mottatt: 20110926. 177562 -Automating Coherent Logic
- Ny medarbeidar Nordic PPP Phd Programme
- An Exact Algorithm for Minimum Distortion Embedding Fedor V. Fomin
- Marc tek over Publiserings-og siteringsstatistikk
- Minimal split completions Pinar Heggernes
- Teoria minorw Michal Pilipczuk
- Ranking and Drawing in Subexponential Time Henning Fernau1
- INFORMATICS ISSN 0333-3590
- INFORMATIKK Nr. 15 18. september 2009
- INFORMATIKK Nr. 21 10 november 2008
- Problems parameterized by treewidth tractable in single exponential time: a logical approach
- Research Proposal: Automating Coherent Logic
- CENTRE FRANCO-NORVEGIEN EN SCIENCES SOCIALES ET HUMAINES FONDATION MAISON DES SCIENCES DE L'HOMME
- How to apply for student accommodation at SiB's web site Go to the following web site: http://www.sib.no/hostels
- INFORMATIKK Nr. 7 5. mars 2010
- Daniel Lokshtanov2 Saket Saurabh2
- Studiekonsulentprosessen Marie Curie
- Linear Kernel for Planar Connected Dominating Set Daniel Lokshtanov
- The stubborn problem is stubborn no more a polynomial algorithm for 3-compatible colouring
- Minimal interval completions Pinar Heggernes1, Karol Suchan2, Ioan Todinca2, and Yngve Villanger1
- Instituttseminar 12.4 STOC suksess
- INFORMATICS 24 June 2011
- Kjreplan for posterrunde, onsdag 25.januar 2012 Sesjon 1
- Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
- Action plan for international activities at the University of Bergen 2007-2009
- dense graph classes and
- INFORMATIKK Nr. 10 26. mars 2010
- Imbalance is Fixed Parameter Tractable Daniel Lokshtanov1, Neeldhara Misra2, Saket Saurabh2
- UNIVERSITETSMUSEET Haakon Sheteligsplass 10
- INFORMATIKK Nr. 27 11. desember 2009
- Even Faster Algorithm for Set Splitting! Daniel Lokshtanov
- Innhold/Content Nye medarbeidere
- Minimal Split Completion of
- Instituttseminar 22 mars Retningsliner for instituttrapportar (no p engelsk)
- ALGORITHMIC LOWER BOUNDS FOR PROBLEMS PARAMETERIZED BY CLIQUE-WIDTH
- INFORMATIKK Nr. 23 11. november 2010
- Announcement and Call for Papers 32nd International Workshop on
- INFORMATIKK Nr. 17 2. oktober 2009
- Deductive Search for Errors in Free Data Type Specifications
- Computing Minimal Triangulations in Time log n) = o(n2.376
- INFORMATIKK Nr. 11 21. august 2009
- Jungles, bundles, and fixed parameter tractability Fedor Fomin and Michal Pilipczuk
- Framdriftsrapport. Rapporteringsfrist: 20111001. Mottatt: 20111003. 176853 -Secure Heterogeneous Information Presentation (heterogeneous content on heterogeneous
- Language requirements Proof of English proficiency
- INTRACTABILITY OF CLIQUE-WIDTH PARAMETERIZATIONS FEDOR V. FOMIN, PETR A. GOLOVACH, DANIEL LOKSHTANOV, AND SAKET
- Project description Optimization techniques in WireLess networks
- Local Search: Is brute-force avoidable? Michael R. Fellows
- Nye satsar for reiser Kurs i frstehjelp
- INFORMATICS 4th of February 2011
- Clustering with Local Restrictions Daniel Lokshtanov
- Generalized graph clustering: recognizing (p, q)-cluster graphs Pinar Heggernes
- Optimal broadcast domination in polynomial time Pinar Heggernes
- INFORMATIKK Nr. 2 29 januar 2009
- INFORMATIKK Nr. 16 3. juni 2010
- Subexponential Algorithms for Partial Cover Problems Fedor V. Fomin
- INFORMATICS 20 May 2011
- Contracting graphs to paths and trees Pinar Heggernes1
- INFORMATIKK Nr. 08 15 mai 2009
- Microsoft University gir deg betalt opplring, sertifisering og jobb
- Fakultetsbudsjett for 2008 Ny stipendiat
- INFORMATIKK Nr. 15 21. mai 2010
- Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments We present a fast local search algorithm that finds an
- INFORMATIKK Nr. 18 9. oktober 2009
- INFORMATIKK Nr. 9 19. mars 2010
- Instituttseminar 29.5 Introduksjonskurs for nytilsette (norsk)
- INFORMATIKK Nr. 22 6. november 2009
- Mte Fagutvalget for institutt for Informatikk fredag 10. September.
- INFORMATICS 31 March 2011
- Distortion is Fixed Parameter Tractable Michael R. Fellows1 Fedor V. Fomin2 Daniel Lokshtanov2 Elena Losievskaja3
- Personregister over Universitetsbiblioteket i Bergens
- The beamer class Manual for version 3.06.
- Investigating the limitations of Java annotations for input validation
- Cutwidth of split graphs and threshold graphs Pinar Heggernes
- Bidimensionality and Kernels Fedor V. Fomin
- INFORMATIKK Nr. 22 29. oktober 2010
- UNIVERSITETET I BERGEN SKNADSFRIST: 15. mai for opptak til haustsemesteret -15. oktober for opptak til vrsemesteret
- UNIVERSITY OF BERGEN LIBRARY
- INFORMATICS ISSN 0333-3590
- Framdriftsrapport. Rapporteringsfrist: 20071001. Mottatt: 20080130. 176853 -Secure Heterogeneous Information Presentation (heterogeneous content on heterogeneous
- UNIVERSITY OF BERGEN NORWEGIAN LANGUAGE COURSES
- Photo:Istockphoto MISSION AND
- Bologna Seminar on "Doctoral Programmes for the European Knowledge Society"
- THE DEPARTMENT OF INFORMATICS NO. 2 2012
- INFORMATICS 03 June 2011
- Cops and Robber Game Without Recharging Fedor V. Fomin
- 14. mars 2012 Vilhelm Bjerknes 150 r
- Guard Games on Graphs: Keep the Intruder Out! Fedor V. Fomin
- A Vertex Incremental Approach for Maintaining Chordality Pinar Heggernes
- UNIVERSITETET I BERGEN SKNADSFRIST: 15. mai for opptak til hstsemesteret -15. oktober for opptak til vrsemesteret
- On cutwidth parameterized by vertex cover Marek Cygan1
- Innhold/Content Gratulerer, Ivan Viola
- Automating Coherent Logic: an overview
- INFORMATIKK Nr. 18 27. august 2010
- Graph modification problems related to graph classes
- Navigation in the Network of Individual Acquaintances
- INFORMATICS ISSN 0333-3590
- Improved Exponential-time Algorithms for Treewidth and Minimum Fill-in
- Instituttseminaret 8. november Ephorte i bruk fr 1. november
- INFORMATIKK Nr. 14 12. mai 2010
- Universitetsmuseet til utstillingspning
- Computing the cutwidth of bipartite permutation graphs in linear time
- Lex M versus MCS-M Yngve Villanger
- Media, Aesthetics, Politics PhD-seminar p Manhattan i New York 19.-21.mai 2010
- INFORMATIKK Nr. 2 29. januar 2010
- nsker du et virkelig ferieminne -kom til Norlandia Marsteinen Hotell ytterst i den vest-
- Broadcast Domination Daniel Lokshtanov
- INFORMATIKK Nr. 1 22. januar 2010
- Innhold/Content HMS runde/round 2,3 september
- INFORMATIKK Nr. 28 18. desember 2009
- INFORMATIKK Nr. 07 24 april 2009
- Studienarbeit Tuning Algorithms for
- Planar Capacitated Dominating Set is W [1]-hard Hans L. Bodlaender1, Daniel Lokshtanov2, and Eelko Penninkx1
- INFORMATIKK Nr. 09 12 juni 2009
- INFORMATIKK Nr. 06 27 mars 2009
- Ny stipendiat Instituttseminar 13. desember
- Publisering 2007 Nei til stilling
- INFORMATIKK Nr. 3 5. februar 2010
- INFORMATIKK Nr. 24 25. november 2010
- Graph Layout problems Parameterized by Vertex Cover Michael R. Fellows1 Daniel Lokshtanov2 Neeldhara Misra3
- Philology and Literary Studies (i Roma) (English text and full programme: scroll down)
- OBS! Hugs senda sknader til Meltzerfoldet fr 3. desember. Instituttseminar 6. desember
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- Characterizing and computing minimal cograph completions Daniel Lokshtanov Federico Mancini Charis Papadopoulos
- Ny postdoktor Instituttseminar 12.4
- Simpler Parameterized Algorithm for OCT Daniel Lokshtanov
- INFORMATIKK Nr. 17 17. juni 2010
- INFORMATIKK Nr. 04 26 februar 2009
- Treewidth Governs the Complexity of Target Set Selection Oren Ben-Zwi
- Saturation up to Redundancy for Tableau and Sequent Calculi
- On Problems as Hard as CNF-Sat Marek Cygan
- Diploma Supplement University of Bergen This Diploma Supplement model was developed by the European Commission, Council of Europe and UNESCO/CEPES. The purpose of the supplement is
- CURRICULUM VITAE FREDERIC DORN
- Gjestefrelesing 1. november Bidrag til fagpedagogisk dag
- C H R I S T I E KONFERANSEN 2 5 . a p r i l 2 0 1 2
- Ny postdoktor Instituttseminar 12.4
- Characterizing and computing minimal cograph completions Daniel Lokshtanov
- Diameter and center computations in networks Diameter and center computations in networks
- A parameterized algorithm for Chordal Sandwich Pinar Heggernes
- Characterizing minimal interval completions
- FOR THE DEPARTMENT OF biOlOGY Biology towards 2020
- STRATEGISK PLAN UNIVERSITETET I BERGEN
- Finding the Longest Isometric Cycle in a Daniel Lokshtanov
- Minimal Split Completion of
- Interval completion with few edges Pinar Heggernes
- Framdriftsrapport. Rapporteringsfrist: 20101001. Mottatt: 20101001. 176853 -Secure Heterogeneous Information Presentation (heterogeneous content on heterogeneous
- Instituttseminar 3. april avlyst Fakultetsstyremtet 4. april, sakliste
- Saving Space by Algebraization Daniel Lokshtanov
- EVALUATIONS of TBLR's Norwegian National PhD-traning course "Aesthetic Memory: Remembrance, Trauma, Place, Space and Boundaries",
- Bandwidth on AT-free graphs Petr Golovach1 Pinar Heggernes1 Dieter Kratsch2
- Instituttseminar 7.6 Tjuveri. OBS!
- On the Directed Degree-Preserving Spanning Tree Problem Daniel Lokshtanov1, Venkatesh Raman2, Saket Saurabh1, and Somnath Sikdar2
- INFORMATIKK Nr. 13 3. mai 2010
- Foundations of Software Technology and Theoretical Computer Science (2009) Submission Determining the Winner of a Dodgson
- INFORMATIKK Nr. 20 5. oktober 2010
- INFORMATIKK Nr. 14 11. september 2009
- On the Complexity of Some Colorful Problems Parameterized by Treewidth6
- INFORMATIKK Nr. 25 13. desember 2010
- INFORMATIKK Nr. 05 13 mars 2009
- Norsk English Comment et alfabet alphabet
- Linear Kernels for (Connected) Dominating Set on H-minor-free graphs Fedor V. Fomin
- INFORMATIKK Nr. 19 17. september 2010
- Gjestefrelesing 19. september Informasjon til langtidsgjester
- Referat mte fagutvalget ved Institutt for Informatikk 19. januar Jrgen Tellnes
- Mte 16. februar 2011 Sted: Akvariet
- Capacitated Domination and Covering: A Parameterized Perspective
- INFORMATICS 28 October 2011
- Hitting forbidden minors: Approximation and Kernelization Fedor V. Fomin
- INFORMATIKK Nr. 16 25. september 2009
- INFORMATICS 15 April 2011
- THE DEPARTMENT OF INFORMATICS NO. 3 2012
- INFORMATICS 19 August 2011
- 14 March 2012 Vilhelm Bjerknes 150 years
- I haust vil instituttseminaret bli leia av ein troika: Dag Haugland, Michal Walicki, yvind Ytrehus
- Sharp Separation and Applications to Exact and Parameterized Algorithms
- INFORMATICS ISSN 0333-3590
- Mtereferat 17. mars 2011
- Adding Security to Mobile Data Collection F. Mancini and K. A. Mughal
- 2 tirsdag 13. mars 2012 da vr ble vitenskap
- INFORMATICS 30 September 2011
- INFORMATIKK Nr. 18 15. desember 2011 GOD JUL
- Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
- INFORMATIKK Nr. 8 12. mars 2010
- Eidhammer professor Forskingstermin 2009
- Fixed Parameter Tractability: an alternative approach to NP-hard problems
- Vedtekter for Overlge Klaus Hanssens legat til Universitetet i Bergen
- Kjell Jrgen Hole nominert til Rosing-prisen Knut Marius Sundt er ogs nominert til Rosing-prisen
- manuscript No. (will be inserted by the editor)
- INFORMATICS 2 September 2011
- Planar k-Path in Subexponential Time and Polynomial Space
- INFORMATICS 16th of March 2011
- On the complexity of computing treelength Daniel Lokshtanov
- Framdriftsrapport. Rapporteringsfrist: 20091001. Mottatt: 20090928. 177562 -Automating Coherent Logic
- INFORMATICS 4th of March 2011
- INFORMATICS ISSN 0333-3590
- Parallel Algorithms for Combinatorial Scientific Computing Department of Informatics and Department of Mathematics,
- CURRICULUM VITAE FREDERIC DORN
- 4 Welcome to the University of Bergen 6 PhD at UiB
- On the Complexity of Reconstructing H-free Graphs from their Star Systems
- INFORMATIKK Nr. 21 15. oktober 2010
- INFORMATICS 29 April 2011
- EKSTRA-NYTT INFORMATIKK
- CURRICULUM VITAE FREDERIC DORN
- Framdriftsrapport. Rapporteringsfrist: 20081001. Mottatt: 20081030. 176853 -Secure Heterogeneous Information Presentation (heterogeneous content on heterogeneous
- Minimum fill-in and treewidth of split+ke and split+kv graphs Federico Mancini
- Spring 2012 1. Compulsory Formalities 4
- Wheel-free deletion is W[2]-Hard Daniel Lokshtanov
- INCOMPRESSIBILITY THROUGH COLORS AND IDS Michael Dom1, Daniel Lokshtanov2, and Saket Saurabh2
- INFORMATICS 11 November 2011
- INFORMATICS 16 September 2011
- Framdriftsrapport. Rapporteringsfrist: 20101001. Mottatt: 20101001. 177562 -Automating Coherent Logic
- On the hardness of losing width Marek Cygan1
- New Methods in Parameterized Algorithms and Complexity
- Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time
- Sknad om smforskmidlar 2008 Publisering 2007
- INFORMATICS 14 October 2011
- INFORMATICS ISSN 0333-3590
- (Meta) Kernelization Hans L. Bodlaender
- Instituttseminar 29. november Rosingpris til Knut Marius Sundt og medstudentar
- Secure Heterogeneous Information Presentation (heterogeneous contents on heterogeneous platforms)
- Framdriftsrapport. Rapporteringsfrist: 20091001. Mottatt: 20090929. 176853 -Secure Heterogeneous Information Presentation (heterogeneous content on heterogeneous
- Bidimensionality and Geometric Graphs Fedor V. Fomin
- INFORMATIKK Nr. 13 4. september 2009
- Redundancy for Geometric Hans de Nivelle
- Two birds with one stone: the best of branchwidth and treewidth with one algorithm
- Plan of action for international activities
- Challenges in Implementing an End-to-End Secure Protocol for Java ME-Based Mobile Data
- E cient Implementation of a Minimal Triangulation Algorithm
- INFORMATIKK Nr. 24 20. november 2009
- Various Parameterizations Strictly Above/Below Expectation Method
- INFORMATIKK Nr. 1 15 januar 2009
- INFORMATIKK Nr. 20 23. oktober 2009 Jubileumsseminar 23.10
- Publication list of Marc Bezem Journal articles
- Regulations for admission to and ranking for Norwegian Section 1 Scope
- INFORMATICS ISSN 0333-3590
- THE DEPARTMENT OF INFORMATICS NO. 4 2012
- INFORMATICS 18th of February 2011
- INFORMATIKK Nr. 19 16. oktober 2009
