• Finding k Disjoint Triangles in an Arbitrary Graph 

      Fellows, Mike; Heggernes, Pinar; Rosamond, Frances; Sloper, Christian; Telle, Jan Arne (Journal article; Peer reviewed, 2004)
      We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a fixed graph H. For H=K 3 (the triangle) we give an O(22klog k + 1.869k n 2) algorithm, and for general ...
    • Passive Cryptanalysis of the UnConditionally Secure Authentication Protocol for RFID Systems 

      Abyaneh, Mohammad Reza Sohizadeh (Journal article, 2011)
      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 ...
    • Strategic optimization of offshore wind farm installation 

      Backe, Stian; Haugland, Dag (Lecture Notes in Computer Science, Chapter; Peer reviewed; Journal article, 2017)
      This work describes logistical planning of offshore wind farm (OWF) installation through linear programming. A mixed integer linear programming (MILP) model is developed to analyze cost-effective port and vessel strategies ...