Sukhamay Kundu

79 papers A* 2C 12Misc 2Journal 42Unranked 21
YearRankTypeTitle / Venue / Authors
2023 — conf
A Correction to the Heuristic Algorithm MinimalFlipSet to Balance Unbalanced Graphs.
COMPLEX NETWORKS (3)
Sukhamay Kundu, Amit Anil Nanavati
2022 — conf
A Better Linear Model Than Regression-Line for Data-Mining Applications.
DMBD (2)
Sukhamay Kundu
2022 — conf
A More Powerful Heuristic for Balancing an Unbalanced Graph.
COMPLEX NETWORKS (2)
Sukhamay Kundu, Amit Anil Nanavati
2019 — conf
Peachy Parallel Assignments (EduHPC 2019).
EduHPC@SC
Mulya Agung, Allen D. Malony, Hiroyuki Takizawa, David P. Bunde, Muhammad Alfian Amrizal, Steven Bogaerts, Ryusuke Egawa, Daniel A. Ellsworth, Jorge Fernández-Fabeiro, Arturo González-Escribano, Sukhamay Kundu, Alina Lazar
2019 J jnl
Relationship between optimal
Inf. Process. Lett.
Sukhamay Kundu
2018 J jnl
A generalized linear time algorithm for an optimal
Inf. Process. Lett.
Sukhamay Kundu
2016 J jnl
A linear time algorithm for optimal k-hop dominating set of a tree.
Inf. Process. Lett.
Sukhamay Kundu, Subhashis Majumder
2010 — conf
Approximation of CFL by Regular Languages for Concurrent Program Verification.
COMPSAC Workshops
Sukhamay Kundu, Supratik Mukhopadhyay
2010 — conf
Service-learning and Active-learning: An Experience-based Comparison.
FECS
Sukhamay Kundu
2009 Misc conf
A Distributed O(|E|) Algorithm for Optimal Link-Reversal.
ICDCN
Sukhamay Kundu
2009 — conf
Content-Model Based Course Design for Active Learning, Critical Thinking and Creativity.
FECS
Sukhamay Kundu
2009 C conf
Requirements Engineering by Connecting Requirements Directly to Data and Operations during Modeling.
ICSEA
Sukhamay Kundu
2009 — conf
Shape Recognition Using a New Spatial Representation and a D.P. Matching Algorithm.
ICAPR
Shiyuan Gu, Sukhamay Kundu
2008 J jnl
An Application-Specific Reliable Data Transfer Protocol in Wireless Sensor Networks.
J. Networks
Damayanti Datta, Sukhamay Kundu
2008 — conf
EasyMAC: A New and Simple Protocol for Slot Assignment.
PDCCS
Jerrolyn Brees, Sukhamay Kundu
2008 — conf
Finding Shortest Multi-Paths with O(N2) Message Complexity.
PDCCS
Jerrolyn Brees, Sukhamay Kundu
2008 — conf
Orthogonal Decomposition of Finite-State Behavior Models As a Basis for Determining Components in Software Architectures.
SETP
Sukhamay Kundu
2008 — conf
Teaching Software Modeling and Design Based on The Science of Design and Science of Learning.
FECS
Sukhamay Kundu
2007 — conf
A software tool for optimal class-hierarchy design based on the use-relationship among functions and variables.
SEDE
Nigel Gwee, Sukhamay Kundu
2007 — conf
Reliable and Efficient Data Transfer in Wireless Sensor Networks via Out-of-Sequence Forwarding and Delayed Request for Missing Packets.
ITNG
Damayanti Datta, Sukhamay Kundu
2007 — conf
Structuring Software Functional Requirements For Automated Design And Verification.
COMPSAC (1)
Sukhamay Kundu
2007 — conf
Using data-integrity constraints in model-based design.
SEDE
Sukhamay Kundu
2006 J jnl
Conflating two polygonal lines.
Pattern Recognit.
Sukhamay Kundu
2005 — conf
A Formal Approach to Designing a Class-Subclass Structure Using a Partial-Order on the Functions.
COMPSAC (1)
Sukhamay Kundu, Nigel Gwee
2005 — conf
Deadlock-Free Distributed Relaxed Mutual-Exclusion Without Revoke-Messages.
IWDC
Sukhamay Kundu
2004 Misc conf
A Modern Graphic Flowchart Layout Tool.
ICDCIT
Sukhamay Kundu
2003 C conf
Modeling Complex Systems by A Set of Interacting Finite-State Models.
APSEC
Sukhamay Kundu
2003 J jnl
Random Generation of Combinatorial Structures using Context-Fee Grammars.
Electron. Notes Discret. Math.
Sukhamay Kundu
2002 C conf
Finite-State Modeling in Software Design: Some Fundamental Techniques.
APSEC
Sukhamay Kundu
2001 C conf
The Canonical Functional Design Based on the Domination-Relationship among Data.
APSEC
Sukhamay Kundu
2001 J jnl
The normal form of a granular fuzzy function.
Fuzzy Sets Syst.
Sukhamay Kundu
2000 J jnl
A better fitness measure of a text-document for a given set of keywords.
Pattern Recognit.
Sukhamay Kundu
2000 J jnl
A representation theorem for min-transitive fuzzy relations.
Fuzzy Sets Syst.
Sukhamay Kundu
2000 J jnl
An optimal O(N
Inf. Process. Lett.
Sukhamay Kundu
2000 J jnl
Learning rules from numerical data by combining geometric and graph-theoretic approach.
Robotics Auton. Syst.
Sukhamay Kundu, Jianhua Chen
2000 J jnl
Similarity relations, fuzzy linear orders, and fuzzy partial orders.
Fuzzy Sets Syst.
Sukhamay Kundu
2000 C conf
The concept of path-closed subsets and its use in software functional design.
APSEC
Sukhamay Kundu
1999 C conf
A Better Fitness Measure of a Text-Document for a Given Set of Keywords.
ISMIS
Sukhamay Kundu
1999 J jnl
Gravitational clustering: a new approach based on the spatial distribution of the points.
Pattern Recognit.
Sukhamay Kundu
1999 J jnl
Membership functions for a fuzzy group from similarity relations.
Fuzzy Sets Syst.
Sukhamay Kundu
1998 J jnl
A solution to histogram-equalization and other related problems by shortest path methods.
Pattern Recognit.
Sukhamay Kundu
1998 J jnl
Fuzzy logic or Lukasiewicz logic: A clarification.
Fuzzy Sets Syst.
Sukhamay Kundu, Jianhua Chen
1998 J jnl
Preference relation on fuzzy utilities based on fuzzy leftness relation on intervals.
Fuzzy Sets Syst.
Sukhamay Kundu
1998 J jnl
The correct form of a recent result on level-subgroups of a fuzzy group.
Fuzzy Sets Syst.
Sukhamay Kundu
1998 J jnl
The min-max composition rule and its superiority over the usual max-min composition rule.
Fuzzy Sets Syst.
Sukhamay Kundu
1997 J jnl
A New Method of Circumscribing Beliefs: The Propositional Case.
Fundam. Informaticae
Sukhamay Kundu, Jianhua Chen
1997 J jnl
Min-transitivity of fuzzy leftness relationship and its application to decision making.
Fuzzy Sets Syst.
Sukhamay Kundu
1996 C conf
A Sound and Complete Fuzzy Logic System Using Zadeh's Implication Operator.
ISMIS
Jianhua Chen, Sukhamay Kundu
1996 J jnl
A new class of theories for which circumscription can be obtained via the predicate completion.
J. Exp. Theor. Artif. Intell.
Sukhamay Kundu, Jianhua Chen
1994 C conf
Fuzzy Logic or Lukasiewicz Logic: A Clarification.
ISMIS
Sukhamay Kundu, Jianhua Chen
1993 J jnl
An O(n) Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection.
SIAM J. Comput.
Sukhamay Kundu
1991 A* conf
A New Logic of Beliefs: Monotonic and Non-Monotonic Beliefs - Part 1.
IJCAI
Sukhamay Kundu
1991 J jnl
A new variant of the A-algorithm which closes a node at most once.
Ann. Math. Artif. Intell.
Sukhamay Kundu
1991 J jnl
Minimal Strings in a Regular Language with Respect to a Partial Order on the Alphabet.
Theor. Comput. Sci.
Sukhamay Kundu
1991 C conf
The Strong Semantics for Logic Programs.
ISMIS
Jianhua Chen, Sukhamay Kundu
1990 — conf
A New and Simple Method for Explicit Computation of a Circumscription.
GWAI
Sukhamay Kundu, Jianhua Chen
1990 J jnl
An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components.
Pattern Recognit.
Sukhamay Kundu, Sridhar Radhakrishnan
1988 C conf
A Correct Form of the Satisfiability-Graph Based Decision Algorithm for Linear Propositional Temporal Logic.
ISMIS
Sukhamay Kundu
1988 J jnl
The Equivalence of the Subregion Representation and the Wall Representation for a Certain Class of Rectangular Dissections.
Commun. ACM
Sukhamay Kundu
1987 J jnl
A new O(n*log n) algorithm for computing the intersection of convex polygons.
Pattern Recognit.
Sukhamay Kundu
1987 C conf
Rule-Discovery from Examples Using a Combination of Syntactic and Semantic Information.
ISMIS
Sukhamay Kundu
1986 J jnl
Modeling the CODASYL DML context dependency for database program conversion.
Inf. Syst.
G. Barbara Demo, Sukhamay Kundu
1986 J jnl
The Call-Return Tree and Its Application to Program Performance Analysis.
IEEE Trans. Software Eng.
Sukhamay Kundu
1986 C conf
Tree resolution and generalized semantic tree.
ISMIS
Sukhamay Kundu
1985 A* conf
An Improved Algorithm for Finding a Key of a Relation.
PODS
Sukhamay Kundu
1985 — conf
Analysis of the Context Dependency of CODASYL Find-Statements with Application to Database Program Conversion.
SIGMOD Conference
G. Barbara Demo, Sukhamay Kundu
1982 — conf
An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph.
ACM Southeast Regional Conference
Sukhamay Kundu
1980 J jnl
Reconstruction of a Pair of Graphs from their Concatenations.
SIAM J. Algebraic Discret. Methods
Sukhamay Kundu, E. Sampathkumar, James B. Shearer, Dean Sturtevant
1979 J jnl
An Intermediate-Value Theorem for Optimum Tree Valuation.
Inf. Process. Lett.
Sukhamay Kundu
1978 J jnl
Note on a Constrained-Path Problem in Program Testing.
IEEE Trans. Software Eng.
Sukhamay Kundu
1977 J jnl
A Linear Tree Partitioning Algorithm.
SIAM J. Comput.
Sukhamay Kundu, Jayadev Misra
1977 J jnl
Sorting Tree, Nestling Tree and Inverse Permutation.
Inf. Process. Lett.
Sukhamay Kundu
1977 J jnl
The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular.
J. Comb. Theory B
Sukhamay Kundu
1976 J jnl
A Linear Algorithm for the Hamiltonian Completion Number of a Tree.
Inf. Process. Lett.
Sukhamay Kundu
1974 J jnl
A factorization theorem for a certain class of graphs.
Discret. Math.
Sukhamay Kundu
1974 J jnl
Existence of Graphs with Three Spanning Trees and Given Degree Sequence.
SIAM J. Comput.
Sukhamay Kundu
1974 J jnl
Generalizations of the k-factor theorem.
Discret. Math.
Sukhamay Kundu
1973 J jnl
A matroid generalization of a theorem of Mendelsohn and Dulmage.
Discret. Math.
Sukhamay Kundu, Eugene L. Lawler
1973 J jnl
The k-factor conjecture is true.
Discret. Math.
Sukhamay Kundu