Martin Sonntag

Orcid: 0000-0003-2862-4627

According to our database1, Martin Sonntag authored at least 30 papers between 1985 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Edge intersection hypergraphs.
Discuss. Math. Graph Theory, 2024

2023
Deriving Trust-Supporting Design Knowledge for AI-Based Chatbots in Customer Service: A Use Case From the Automotive Industry.
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.
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.
Proceedings of the WI for Grand Challenges, 2022

2020
Niche hypergraphs of products of digraphs.
Discuss. Math. Graph Theory, 2020

2016
Product of digraphs and their competition graphs.
Discuss. Math. Graph Theory, 2016

Niche hypergraphs.
Discuss. Math. Graph Theory, 2016

2015
Some Results on Exclusive Sum Labelings of Hypergraphs.
Graphs Comb., 2015

2013
Neighborhood structures and products of undirected graphs.
Discret. Math., 2013

2012
Iterated neighborhood graphs.
Discuss. Math. Graph Theory, 2012

2010
Structural Properties and Hamiltonicity of Neighborhood Graphs.
Graphs Comb., 2010

2009
Competition Hypergraphs of Products of Digraphs.
Graphs Comb., 2009

2008
Competition hypergraphs of digraphs with certain properties II. Hamiltonicity.
Discuss. Math. Graph Theory, 2008

Competition hypergraphs of digraphs with certain properties I. Strong connectedness.
Discuss. Math. Graph Theory, 2008

2007
A characterization of hypercacti.
Discret. Math., 2007

2004
Difference labelling of digraphs.
Discuss. Math. Graph Theory, 2004

Competition hypergraphs.
Discret. Appl. Math., 2004

2003
Difference labelling of cacti.
Discuss. Math. Graph Theory, 2003

2002
Antimagic vertex labelings of hypergraphs.
Discret. Math., 2002

2001
On the sum number and integral sum number of hypertrees and complete hypergraphs.
Discret. Math., 2001

2000
Sum numbers of hypertrees.
Discret. Math., 2000

1995
Reno: a component-based user interface.
Proceedings of the Human Factors in Computing Systems, 1995

1993
Hamiltonicity of the Disjunction of Two Hypergraphs.
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.
J. Inf. Process. Cybern., 1991

Hamiltonicity and Traceability of the Lexicographic Product of Hypergraphs.
J. Inf. Process. Cybern., 1991

1990
Hamiltonicity of the Normal Product of Hypergraphs.
J. Inf. Process. Cybern., 1990

1989
Hamiltonian Properties of the Cartesian Sum of Hypergraphs.
J. Inf. Process. Cybern., 1989

1987
Some Results on Hamitonian Properties of Products of Digraphs II. Pancyclicity Properties.
J. Inf. Process. Cybern., 1987

Some Results on Hamiltonian Properties of Products of Digraphs I. t-Hamiltonian Properties and Strong Path-Connectedness.
J. Inf. Process. Cybern., 1987

1985
Some Hamiltonian Properties of Products of Digraphs.
J. Inf. Process. Cybern., 1985


  Loading...