Sökning: "Carl Hamilton"

Visar resultat 1 - 5 av 7 avhandlingar innehållade orden Carl Hamilton.

  1. 1. Implementing Road Pricing : Standards, Institutions, Costs, and Public Acceptance

    Författare :Carl J. Hamilton; Jonas Eliasson; Robert Lindsey; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : Much has been researched and written about road pricing, and especially how it affects traffic flow, congestion, the environment, and social welfare in general. This doctoral thesis analyses the implementation of road user charges rather than its effects. The dissertation consists of five separate papers, each addressing a subset of the topic. LÄS MER

  3. 2. Regulating road user charging

    Författare :Carl J. Hamilton; Jonas Eliasson; James Odeck; KTH; []
    Nyckelord :;

    Sammanfattning : .... LÄS MER

  4. 3. Online Sexual Behaviours Among Swedish Youth : Characteristics, Associations and Consequences

    Författare :Linda S. Jonsson; Carl Göran Svedin; Margareta Hydén; Cathrine Hamilton-­Giachritsis; Linköpings universitet; []
    Nyckelord :MEDICIN OCH HÄLSOVETENSKAP; MEDICAL AND HEALTH SCIENCES; SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Online; Internet; sexual behaviour; selling sex; sexting; youth; adolescents;

    Sammanfattning : Online sexual behaviours refer to sexual activities where the Internet and/or mobile phone are used. The aims of this thesis were to investigate young people and their experiences of different online sexual behaviours with regard to characteristics, associations and consequences, by using data from a representative sample of 3,503 Swedish youth (m= 18. LÄS MER

  5. 4. Local Conditions for Long Cycles in Graphs

    Författare :Jonas B. Granholm; Carl Johan Casselgren; Armen Asratian; Jørgen Bang-Jensen; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is called Hamiltonian if it contains such a cycle. The problem of determining if a graph is Hamiltonian has been studied extensively, and there are many known sufficient conditions both for Hamiltonicity and for other, related properties. LÄS MER

  7. 5. Local Conditions for Cycles in Graphs

    Författare :Jonas Granholm; Armen Asratian; Carl Johan Casselgren; Victor Falgas Ravry; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is called Hamiltonian if it contains such a cycle. The problem of determining if a graph is Hamiltonian has been studied extensively, and there are many known sufficient conditions for Hamiltonicity. LÄS MER