Now showing items 1-20 of 60

    • An Approach for Investigation of Geochemical Rock-Fluid Interactions 

      Bringedal, Carina; Berre, Inga; Radu, Florin A. (Stanford University, 2014)
      Geochemistry has a substantial impact in exploiting of geothermal systems. When water is injected in a geothermal reservoir, the injected water and in-situ brine have different temperatures and chemical compositions and ...
      Conference object
    • Approximating Acyclicity Parameters of Sparse Hypergraphs 

      Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios (Dagstuhl Publishing, 2009)
      The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello (PODS'99, PODS'01) in order to extend the concept of hypergraph acyclicity. These notions were further generalized ...
      Conference object
    • B-chromatic number: Beyond NP-hardness 

      Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket (Dagstuhl Publishing, 2015)
      The b-chromatic number of a graph G, chi_b(G), is the largest integer k such that G has a k-vertex coloring with the property that each color class has a vertex which is adjacent to at least one vertex in each of the other ...
      Conference object
    • Co2 trapping in sloping aquafiers: High resolution numerical simulations 

      Elenius, Maria; Tchelep, Hamdi A.; Johannsen, Klaus (CIMNE, 2010)
      Conference object
    • Colluding Tags Attack on the ECC-based Grouping Proofs for Rfids 

      Abyaneh, Mohammad Reza Sohizadeh (The author, 2012)
      Recently, a new privacy-preserving elliptic curve based grouping proof protocol with colluding tag prevention( CTP) has been proposed. The CTP protocol is claimed to be resistant against colluding tags attacks in which ...
      Conference object
    • Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings 

      Pilipczuk, Michal Pawel (Dagstuhl Publishing, 2013)
      The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semi-complete digraphs, developed in a recent series of papers by Chudnovsky, Fradkin, Kim, ...
      Conference object
    • Connecting Vertices by Independent Trees 

      Basavaraju, Manu; Fomin, Fedor; Golovach, Petr; Saurabh, Saket (Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, 2014)
      We study the paramereteized complexity of the following connectivity problem. For a vertex subset U of a graph G, trees T1, . . . , Ts of G are completely independent spanning trees of U if each of them contains U , and ...
      Conference object
    • Cosmic Ray Signatures from Decaying Gravitino Dark Matter 

      Bomark, Nils-Erik; Lola, Smaragda; Osland, Per; Raklev, Are R. (Scuola Internazionale Superiore di Studi Avanzati, 2009)
      We study the charged cosmic rays arising from the slow decay of gravitino dark matter within supersymmetric scenarios with trilinear R-parity violation. It is shown that operators of the LLE type can very well account ...
      Conference object
    • Counting Instances of Software Components 

      Bezem, Marcus A.; Truong, Anh Hoang (University of Bergen, Department of Informatics, 2004-07-13)
      Component software is software that has been assembled from various pieces of standardized, reusable computer programs, so-called components. Executing component software creates instances of these components. For several ...
      Conference object
    • Direct data transfer between SOAP web services in Orchestration 

      Subramanian, Sattanathan; Sztromwasser, Paweł; Puntervoll, Pål; Petersen, Kjell (ACM, 2012)
      In scientific data analysis, workflows are used to integrate and coordinate resources such as databases and tools. Workflows are normally executed by an orchestrator that invokes component services and mediates data ...
      Conference object
    • Domain decomposition preconditioning for non-linear elasticity problems 

      Keilegavlen, Eirik; Skogestad, Jan Ole; Nordbotten, Jan Martin (International Centre for Numerical Methods in Engineering, 2014)
      We consider domain decomposition techniques for a non-linear elasticity problem. Our main focus is on non-linear preconditioning, realized in the framework of additive Schwarz preconditioned inexact Newton (ASPIN) methods. ...
      Conference object
    • Editing to Eulerian Graphs 

      Dabrowski, Konrad K.; Golovach, Petr; van' t Hof, Pim; Paulusma, Daniël (Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, 2014)
      We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let ea, ed and vd denote the operations edge addition, edge deletion and ...
      Conference object
    • Electrical conductivity of fractured media: A computational study of the self-consistent method 

      Sævik, Pål Næverlid; Berre, Inga; Jakobsen, Morten; Lien, Martha (Society of Exploration Geophysicists, 2012)
      Effective medium theory can be used to link conductivity estimation methods with prior knowledge about the distribution of fractures in the investigated geological structure. In the literature, little work has been ...
      Conference object
    • Enumerating minimal connected dominating sets in graphs of bounded chordality 

      Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter (Dagstuhl Publishing, 2015)
      Listing, generating or enumerating objects of specified type is one of the principal tasks in algorithmics. In graph algorithms one often enumerates vertex subsets satisfying a certain property. We study the enumeration ...
      Conference object
    • Fast biclustering by dual parameterization 

      Drange, Pål Grønås; Reidl, Felix; Villaamil, Fernando Sánchez; Sikdar, Somnath (Dagstuhl Publishing, 2015)
      We study two clustering problems, Starforest Editing, the problem of adding and deleting edges to obtain a disjoint union of stars, and the generalization Bicluster Editing. We show that, in addition to being NP-hard, none ...
      Conference object
    • Finding even subgraphs even faster 

      Goyal, Prachi; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket (Dagstuhl Publishing, 2015)
      Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k ...
      Conference object
    • Finding Induced Subgraphs via Minimal Triangulations 

      Fomin, Fedor; Villanger, Yngve (Dagstuhl Publishing, 2010)
      Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems in- cluding Minimum Fill-in and Treewidth. We discover unexpected ...
      Conference object
    • Finding k Disjoint Triangles in an Arbitrary Graph 

      Fellows, Mike; Heggernes, Pinar; Rosamond, Frances; Sloper, Christian; Telle, Jan Arne (Springer Verlag, 2004)
      Conference object
    • Flame Propagation in Dust Clouds: Challenges for Model Validation 

      Skjold, Trygve (2010)
      Modelling of industrial dust explosions poses a formidable challenge to researchers and safety engineers. Whereas current best practice with respect to modelling the consequences of vapour cloud explosions in the petroleum ...
      Conference object
    • Interactive Visualization of Streaming Data with Kernel Density Estimation 

      Lampe, Ove Daae; Hauser, Helwig (IEEE, 2011)
      In this paper, we discuss the extension and integration of the statistical concept of Kernel Density Estimation (KDE) in a scatterplotlike visualization for dynamic data at interactive rates. We present a line kernel ...
      Conference object