• Maximum matching width: New characterizations and a fast algorithm for dominating set 

      Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne (Conference object; Peer reviewed; Journal article, 2015)
      We give alternative definitions for maximum matching width, e.g., a graph G has mmw(G) <= k if and only if it is a subgraph of a chordal graph H and for every maximal clique X of H there exists A,B,C \subseteq X with A ...
    • Minimum Fill-in of Sparse Graphs: Kernelization and Approximation 

      Fomin, Fedor; Geevarghese, Philip; Villanger, Yngve (Conference object; Peer reviewed; Journal article, 2011)
      The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. The problem has important applications in numerical algebra, in particular in sparse matrix computations. We develop ...
    • Model Checking Healthcare Workflows Using Alloy 

      Wang, Xiaoliang; Rutle, Adrian (Conference object; Peer reviewed, 2014)
      Workflows are used to organize business processes, and workflow management tools are used to guide users in which order these processes should be performed. These tools increase organizational efficiency and enable users ...
    • A New Generating Set Search Algorithm for Partially Separable Functions 

      Frimannslund, Lennart; Steihaug, Trond (ADVCOMP 2010 : The Fourth International Conference on Advanced Engineering Computing and Applications in Sciences, Conference object; Peer reviewed, 2010)
      A new derivative-free optimization method for unconstrained optimization of partially separable functions is presented. Using average curvature information computed from sampled function values the method generates an ...
    • Non-Constructivity in Kan Simplicial Sets 

      Bezem, Marc; Coquand, Thierry; Parmann, Erik (Conference object; Peer reviewed, 2015)
      We give an analysis of the non-constructivity of the following basic result: if X and Y are simplicial sets and Y has the Kan extension property, then Y X also has the Kan extension property. By means of Kripke countermodels ...
    • Obscurance-based Volume Rendering Framework 

      Ruiz, Marc; Boada, Imma; Viola, Ivan; Bruckner, Stefan; Feixas, Miquel; Sbert, Mateu (Proceedings of Volume Graphics 2008., Conference object; Peer reviewed, 2008)
      lighting effects in a faster way than global illumination. Its application in volume visualization is of special interest since it permits us to generate a high quality rendering at a low cost. In this paper, we propose ...
    • On Isotopic Shift Construction for Planar Functions 

      Budaghyan, Lilya; Calderini, Marco; Carlet, Claude; Coulter, Robert; Villa, Irene (Chapter; Conference object; Peer reviewed, 2019)
      CCZ-equivalence is the most general currently known equivalence relation for functions over finite fields preserving planarity and APN properties. However, for the particular case of quadratic planar functions isotopic ...
    • On Stable Marriages and Greedy Matchings 

      Manne, Fredrik; Naim, Md.; Lerring, Håkon; Halappanavar, Mahantesh (Conference object; Peer reviewed, 2016)
      Research on stable marriage problems has a long and mathematically rigorous history, while that of exploiting greedy matchings in combinatorial scientific computing is a younger and less developed research field. We consider ...
    • On the Privacy of Two Tag Ownership Transfer Protocols for RFIDs 

      Abyaneh, Mohammad Reza Sohizadeh (Conference object, 2012)
      In this paper, the privacy of two recent RFID tag ownership transfer protocols are investigated against the tag owners as adversaries. The first protocol called ROTIV is a scheme which provides a privacy-preserving ownership ...
    • On the Security of Non-Linear HB (NLHB) Protocol Against Passive Attack 

      Abyaneh, Mohammad Reza Sohizadeh (Conference object, 2012)
      As a variant of the HB authentication protocol for RFID systems, which relies on the complexity of decoding linear codes against passive attacks, Madhavan et al. presented Non-Linear HB(NLHB) protocol. In contrast to HB, ...
    • Optimizing Approximate Weighted Matching on Nvidia Kepler K40 

      Naim, Md.; Manne, Fredrik; Halappanavar, Mahantesh; Tumeo, Antonino; Langguth, Johannes (Conference object; Peer reviewed, 2018)
      Matching is a fundamental graph problem with numerous applications in science and engineering. While algorithms for computing optimal matchings are difficult to parallelize, approximation algorithms on the other hand ...
    • Parameterized complexity of secluded connectivity problems 

      Fomin, Fedor; Golovach, Petr; Karpov, Nikolay; Kulikov, Alexander S (Conference object; Peer reviewed; Journal article, 2015)
      The Secluded Path problem introduced by Chechik et al. in [ESA 2013] models a situation where a sensitive information has to be transmitted between a pair of nodes along a path in a network. The measure of the quality of ...
    • Passive Cryptanalysis of the UnConditionally Secure Authentication Protocol for RFID Systems 

      Abyaneh, Mohammad Reza Sohizadeh (Conference object, 2012)
      Recently, Alomair et al. proposed the first Un- Conditionally Secure mutual authentication protocol for lowcost RFID systems(UCS-RFID). The security of the UCSRFID relies on five dynamic secret keys which are updated at ...
    • Pooling Problems with Single-Flow Constraints 

      Haugland, Dag (Chapter; Conference object; Peer reviewed, 2019)
      The pooling problem is a frequently studied extension of the traditional minimum cost flow problem, in which the composition of the flow is subject to restrictions. In a network consisting of three layers of nodes, the ...
    • Quick but odd growth of cacti 

      Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket (Conference object; Peer reviewed; Journal article, 2015)
      Let F be a family of graphs. Given an input graph G and a positive integer k, testing whether G has a k-sized subset of vertices S, such that G\S belongs to F, is a prototype vertex deletion problem. These type of problems ...
    • Refined Complexity of PCA with Outliers 

      Fomin, Fedor; Golovach, Petr; Panolan, Fahad; Simonov, Kirill (Conference object; Peer reviewed; Journal article, 2019)
      Principal component analysis (PCA) is one of the most fundamental procedures in exploratory data analysis and is the basic step in applications ranging from quantitative finance and bioinformatics to image analysis and ...
    • Reflections on Courses for Software Language Engineering 

      Bagge, Anya Helene; Lämmel, Ralf; Zaytsev, Vadim (Conference object; Peer reviewed, 2014)
      Software Language Engineering (SLE) has emerged as a field in computer science research and software engineering, but it has yet to become entrenched as part of the standard curriculum at universities. Many places have a ...
    • Security Analysis of two Distance-Bounding Protocols 

      Abyaneh, Mohammad Reza Sohizadeh (Conference object, 2012)
      In this paper, we analyze the security of two recently proposed distance bounding protocols called the “Hitomi” and the “NUS” protocols. Our results show that the claimed security of both protocols has been overestimated. ...
    • The SHIP Validator: An Annotation-based Content-Validation Framework for Java Applications 

      Mancini, Federico; Hovland, Dag; Mughal, Khalid A. (Conference object; Peer reviewed, 2010)
      In this paper, we investigate the use of Java annotations for software security purposes. In particular, we implement a framework for content validation where the validation tests are specified by annotations. This approach ...
    • Smart Surrogate Widgets for Direct Volume Manipulation 

      Stoppel, Sergej; Bruckner, Stefan (Conference object; Peer reviewed; Journal article, 2018)
      Interaction is an essential aspect in volume visualization, yet common manipulation tools such as bounding boxes or clipping plane widgets provide rather crude tools as they neglect the complex structure of the underlying ...