Recent Submissions

  • Maximum number of edges in graph classes under degree and matching constraints 

    Måland, Erik Kvam (The University of Bergen, 2015-05-12)
    In extremal graph theory, we ask how large or small a property of a graph can be, when the graph has to satisfy certain constraints. In this thesis, we ask how many edges a graph can have with restrictions on its degree ...
  • Community Detection in Social Networks 

    Fasmer, Erlend Eindride (The University of Bergen, 2015-05-01)
    Social networks usually display a hierarchy of communities and it is the task of community detection algorithms to detect these communities and preferably also their hierarchical relationships. One common class of ...
  • Fast Method for Maximum-Flow Problem with Minimum-Lot Sizes 

    Ganeshan, Vithya (The University of Bergen, 2015-03-03)
    In transportation networks, such as pipeline networks for transporting natural gas, it is often impractical to send across amounts of flow below a certain threshold. Such lower threshold is referred as the minimum-lot size. ...
  • Molecular mechanisms of adaptation emerging from the physics and evolution of nucleic acids and proteins 

    Goncearenco, Alexander; Ma, Binguang; Berezovsky, Igor (Oxford University Press, 2014)
    DNA, RNA and proteins are major biological macromolecules that coevolve and adapt to environments as components of one highly interconnected system. We explore here sequence/structure determinants of mechanisms of adaptation ...
  • Combining Aspect-Oriented and Strategic Programming 

    Kalleberg, Karl Trygve; Visser, Eelco (Elsevier, 2006-01)
    Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very difficult or even impossible to modularizewith ...
  • Interfacing concepts: Why declaration style shouldn't matter 

    Bagge, Anya Helene; Haveraaen, Magne (Elsevier, 2010-09-17)
    A concept (or signature) describes the interface of a set of abstract types by listing the operations that should be supported for those types. When implementing a generic operation, such as sorting, we may then specify ...
  • Hybrid visibility compositing and masking for illustrative rendering 

    Bruckner, Stefan; Rautek, Peter; Viola, Ivan; Roberts, Mike; Sousa, Mario Costa; Gröller, M. Eduard (Elsevier, 2010-08)
    In this paper, we introduce a novel framework for the compositing of interactively rendered 3D layers tailored to the needs of scientific illustration. Currently, traditional scientific illustrations are produced in a ...
  • Axiom-Based Transformations: Optimisation and Testing 

    Bagge, Anya Helene; Haveraaen, Magne (Elsevier, 2009-10-10)
    Programmers typically have knowledge about properties of their programs that aren't explicitly expressed in the code ­ properties that may be very useful for, e.g., compiler optimisation and automated testing. Although ...
  • Current Trends for 4D Space-Time Topology for Semantic Flow Segmentation 

    Matković, Krešimir; Lež, Alan; Hauser, Helwig; Pobitzer, Armin; Theisel, Holger; Kuhn, Alexander; Otto, Mathias; Peikert, Ronald; Schindler, Benjamin; Fuchs, Raphael (Elsevier, 2011)
  • A Diagrammatic Logic for Object-Oriented Visual Modeling 

    Diskin, Zinovy; Wolter, Uwe Egbert (Elsevier, 2008-11-21)
    Formal generalized sketches is a graph-based specification format that borrows its main ideas from categorical and ordinary first-order logic, and adapts them to software engineering needs. In the engineering jargon, it ...
  • Fusing a Transformation Language with an Open Compiler 

    Kalleberg, Karl Trygve; Visser, Eelco (Elsevier, 2008-04-01)
    Program transformation systems provide powerful analysis and transformation frameworks as well as concise languages for language processing, but instantiating them for every subject language is an arduous task, most often ...
  • The Second Rewrite Engines Competition 

    Durán, Francisco; Roldán, Manuel; Balland, Emilie; van den Brand, Mark; Eker, Steven; Kalleberg, Karl Trygve; Kats, Lennart C. L.; Moreau, Pierre-Etienne; Schevchenko, Ruslan; Visser, Eelco (Elsevier, 2009-06-29)
    The Second Rewrite Engines Competition (REC) was celebrated as part of the 7th Workshop on Rewriting Logic and its Applications (WRLA 2008). In this edition of the competition participated five systems, namely ASF+SDF, ...
  • Domain-Specific Languages for Composable Editor Plugins 

    Kats, Lennart C. L.; Kalleberg, Karl Trygve; Visser, Eelco (Elsevier, 2010-09-17)
    Modern IDEs increase developer productivity by incorporating many different kinds of editor services. These can be purely syntactic, such as syntax highlighting, code folding, and an outline for navigation; or they can be ...
  • Exploring Subexponential Parameterized Complexity of Completion Problems 

    Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michal Pawel; Villanger, Yngve (Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014-02-19)
    Let F be a family of graphs. In the F-Completion problem, we are given an n-vertex graph G and an integer k as input, and asked whether at most k edges can be added to G so that the resulting graph does not contain a ...
  • On cutwidth parameterized by vertex cover 

    Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Saurabh, Saket (Springer, 2014-04)
    We study the CUTWIDTH problem, where the input is a graph G, and the objective is find a linear layout of the vertices that minimizes the maximum number of edges intersected by any vertical line inserted between two ...
  • Parameterized complexity of Eulerian deletion problems 

    Cygan, Marek; Pilipczuk, Marcin; Marx, Dániel; Pilipczuk, Michal Pawel; Schlotter, Ildikó (Springer, 2014-01)
    We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity ...
  • Solving the 2-disjoint connected subgraphs problem faster than 2ⁿ 

    Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Wojtaszczyk, Jakub Onufry (Springer, 2014-10)
    The 2-DISJOINT CONNECTED SUBGRAPHS problem, given a graph along with two disjoint sets of terminals Z1,Z2, asks whether it is possible to find disjoint sets A1,A2, such that Z1 ⊆ A1, Z2 ⊆ A2 and A1,A2 induce connected ...
  • Managing spatial selections with contextual snapshots 

    Mindek, Peter; Gröller, Eduard; Bruckner, Stefan (Wiley, 2014-12)
    Spatial selections are a ubiquitous concept in visualization. By localizing particular features, they can be analysed and compared in different views. However, the semantics of such selections often depend on specific ...
  • Scaling the scales - A suggested improvement to IBM's Intelligent Recommendation Algorithm 

    Myrtveit, Magnar (The University of Bergen, 2014-11-20)
    Recommender systems appear in a large variety of applications, and their use has become very common in recent years. As a lot of money can be made by companies having a better recommender system than their competitors, ...
  • The index tracking problem with a limit on portfolio size 

    Mutunge, Purity Kamene (The University of Bergen, 2014-11-19)
    For a passive fund manager tracking a benchmark, it is not uncommon to select some, and not all the assets in the index to his portfolio. In this thesis, we consider the problem of minimizing the tracking error under the ...

View more