Raghu Kacker

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Mehra N. Borazjany

> Home > Persons > Raghu Kacker

Publications

2013
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/icst/YuLBKK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icst/YuLBKK13
Linbin Yu, Yu Lei, Mehra Nouroz Borazjany, Raghu Kacker, D. Richard Kuhn:
An Efficient Algorithm for Constraint Handling in Combinatorial Test Generation. ICST 2013: 242-251
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/icst/GhandehariBLKK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icst/GhandehariBLKK13
Laleh Shikh Gholamhossein Ghandehari, Mehra N. Borazjany, Yu Lei, Raghu Kacker, D. Richard Kuhn:
Applying Combinatorial Testing to the Siemens Suite. ICST Workshops 2013: 362-371
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/icst/BorazjanyGLKK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icst/BorazjanyGLKK13
Mehra N. Borazjany, Laleh Shikh Gholamhossein Ghandehari, Yu Lei, Raghu Kacker, Rick Kuhn:
An Input Space Modeling Methodology for Combinatorial Testing. ICST Workshops 2013: 372-381
2012
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/icst/BorazjanyYLKK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icst/BorazjanyYLKK12
Mehra N. Borazjany, Linbin Yu, Yu Lei, Raghu Kacker, Rick Kuhn:
Combinatorial Testing of ACTS: A Case Study. ICST 2012: 591-600

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.