Martin Sonntag

According to our database, Martin Sonntag authored at least 29 papers between 1985 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Deriving Trust-Supporting Design Knowledge for AI-Based Chatbots in Customer Service: A Use Case From the Automotive Industry.

Martin Sonntag, Jens Mehmann, Frank Teuteberg

J. Organ. Comput. Electron. Commer., October, 2023

Trust-Supporting Design Elements as Signals for AI-Based Chatbots in Customer Service: A Behavior-Based Explanatory Model.

Martin Sonntag, Jens Mehmann, Frank Teuteberg

Int. J. Serv. Sci. Manag. Eng. Technol., 2023

2022

AI-based Conversational Agents for Customer Service - A Study of Customer Service Representative' Perceptions Using TAM 2.

Martin Sonntag, Jens Mehmann, Frank Teuteberg

Proceedings of the WI for Grand Challenges, 2022

2020

Niche hypergraphs of products of digraphs.

Martin Sonntag, Hanns-Martin Teichert

Discuss. Math. Graph Theory, 2020

2016

Product of digraphs and their competition graphs.

Martin Sonntag, Hanns-Martin Teichert

Discuss. Math. Graph Theory, 2016

Niche hypergraphs.

Christian Garske, Martin Sonntag, Hanns-Martin Teichert

Discuss. Math. Graph Theory, 2016

2015

Some Results on Exclusive Sum Labelings of Hypergraphs.

Martin Sonntag, Hanns-Martin Teichert

Graphs Comb., 2015

2013

Neighborhood structures and products of undirected graphs.

Martin Sonntag, Hanns-Martin Teichert

Discret. Math., 2013

2012

Iterated neighborhood graphs.

Martin Sonntag, Hanns-Martin Teichert

Discuss. Math. Graph Theory, 2012

2010

Structural Properties and Hamiltonicity of Neighborhood Graphs.

Ingo Schiermeyer, Martin Sonntag, Hanns-Martin Teichert

Graphs Comb., 2010

2009

Competition Hypergraphs of Products of Digraphs.

Martin Sonntag, Hanns-Martin Teichert

Graphs Comb., 2009

2008

Competition hypergraphs of digraphs with certain properties II. Hamiltonicity.

Martin Sonntag, Hanns-Martin Teichert

Discuss. Math. Graph Theory, 2008

Competition hypergraphs of digraphs with certain properties I. Strong connectedness.

Martin Sonntag, Hanns-Martin Teichert

Discuss. Math. Graph Theory, 2008

2007

A characterization of hypercacti.

Martin Sonntag

Discret. Math., 2007

2004

Difference labelling of digraphs.

Martin Sonntag

Discuss. Math. Graph Theory, 2004

Competition hypergraphs.

Martin Sonntag, Hanns-Martin Teichert

Discret. Appl. Math., 2004

2003

Difference labelling of cacti.

Martin Sonntag

Discuss. Math. Graph Theory, 2003

2002

Antimagic vertex labelings of hypergraphs.

Martin Sonntag

Discret. Math., 2002

2001

On the sum number and integral sum number of hypertrees and complete hypergraphs.

Martin Sonntag, Hanns-Martin Teichert

Discret. Math., 2001

2000

Sum numbers of hypertrees.

Martin Sonntag, Hanns-Martin Teichert

Discret. Math., 2000

1995

Reno: a component-based user interface.

Randy Kerr, Mike Markley, Martin Sonntag, Tandy Trower

Proceedings of the Human Factors in Computing Systems, 1995

1993

Hamiltonicity of the Disjunction of Two Hypergraphs.

Martin Sonntag

J. Inf. Process. Cybern., 1993

1991

Corrigendum to: "Hamiltonicity of the Normal Product of Hypergraphs" in: J. Inform. Process. Cybernet. EIK26(1990) 7, 415-433.

Martin Sonntag

J. Inf. Process. Cybern., 1991

Hamiltonicity and Traceability of the Lexicographic Product of Hypergraphs.

Martin Sonntag

J. Inf. Process. Cybern., 1991

1990

Hamiltonicity of the Normal Product of Hypergraphs.

Martin Sonntag

J. Inf. Process. Cybern., 1990

1989

Hamiltonian Properties of the Cartesian Sum of Hypergraphs.

Martin Sonntag

J. Inf. Process. Cybern., 1989

1987

Some Results on Hamitonian Properties of Products of Digraphs II. Pancyclicity Properties.

Martin Sonntag

J. Inf. Process. Cybern., 1987

Some Results on Hamiltonian Properties of Products of Digraphs I. t-Hamiltonian Properties and Strong Path-Connectedness.

Martin Sonntag

J. Inf. Process. Cybern., 1987

1985

Some Hamiltonian Properties of Products of Digraphs.

Martin Sonntag

J. Inf. Process. Cybern., 1985