Updated: April 5th, 2024 11:51

2020 journal article

Efficient algorithms for finding2-mediansof a tree

*NETWORKS*, *77*(3), 383–402.

author keywords: 2-median; binary search; linear time; priority queue; sorting; trees

TL;DR:
A framework that unifies all efficient algorithms for the 2‐median problem on trees is presented, which isolates the nonlinear part of the computation so that future time‐bound improvements are easily incorporated.
(via Semantic Scholar)

Sources: Web Of Science, ORCID, NC State University Libraries

Added: October 5, 2020

2017 journal article

Algorithm Animation with Galant

*IEEE COMPUTER GRAPHICS AND APPLICATIONS*, *37*(1), 8–14.

UN Sustainable Development Goal Categories

4. Quality Education
(Web of Science; OpenAlex)

Sources: Web Of Science, NC State University Libraries, ORCID

Added: August 6, 2018

2017 report

Efficient Algorithms for Finding 2-Medians of a Tree

North Carolina State University. Dept. of Computer Science.

Source: ORCID

Added: December 6, 2019

2016 report

A gentle introduction to matroid algorithmics

North Carolina State University. Dept. of Computer Science.

Source: ORCID

Added: December 6, 2019

2016 report

Edge offset in drawings of layered graphs with evenly-spaced nodes on each layer

North Carolina State University. Dept. of Computer Science.

Source: ORCID

Added: December 6, 2019

2016 journal article

On size-constrained minimum s-t cut problems and size-constrained dense subgraph problems

*THEORETICAL COMPUTER SCIENCE*, *609*, 434–442.

author keywords: At-least-k-subgraph problem; At-most-k-subgraph problem; Approximation algorithm; The minimum s-t cut with at-least-k vertices problem; The minimum s-t cut with at-most-k vertices problem; The minimum s-t cut with exactly k vertices problem

TL;DR:
The minimum s-t cut with at-least-k vertices problem, the minimum s -t cutWith at-most-k-subgraph problem, and the Minimum s-T cut with exactly k vertices problems are introduced and it is proved that they are NP-complete.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

Sources: Web Of Science, NC State University Libraries

Added: August 6, 2018

2014 conference paper

Including blind people in computing through access to graphs

*Proceedings of the 16th international ACM SIGACCESS conference on Computers & accessibility*, 91–98.

Event: ACM

Source: ORCID

Added: December 6, 2019

2013 conference paper

GSK: universally accessible graph sketching

*Proceeding of the 44th ACM technical symposium on Computer science education*, 221–226.

Event: ACM

Source: ORCID

Added: December 6, 2019

2013 conference paper

Integrating communication skills in data structures and algorithms courses

*2013 IEEE Frontiers in Education Conference (FIE)*, 1503–1509.

Event: IEEE

Source: ORCID

Added: December 6, 2019

2012 journal article

A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study

*Journal of Experimental Algorithmics (JEA)*, *17*, 1–3.

Source: ORCID

Added: December 6, 2019

2010 report

Bottleneck crossing minimization in layered graphs

(No. TR-2010-13). Dept of Computer Science, North Carolina State University.

Source: ORCID

Added: December 6, 2019

2010 report

High-contrast algorithm behavior: Observation, conjecture, and experimental design

North Carolina State University. Dept. of Computer Science.

Source: ORCID

Added: December 6, 2019

2009 chapter

Systematic Exploration of Efficient Query Plans for Automated Database Restructuring

In *Advances in Databases and Information Systems* (pp. 133–148).

Sources: Crossref, NC State University Libraries

Added: February 24, 2020

2009 conference paper

Systematic exploration of efficient query plans for automated database restructuring

*East European Conference on Advances in Databases and Information Systems*, 133–148.

Event: Springer, Berlin, Heidelberg

Source: ORCID

Added: December 6, 2019

2008 conference paper

Exact and inexact methods for selecting views and indexes for OLAP performance improvement

*Proceedings of the 11th international conference on Extending database technology: Advances in database technology*, 311–322.

Event: ACM

Source: ORCID

Added: December 6, 2019

2008 report

Matrix depictions for large layered graphs

(No. TR-2008-17). Dept. Computer Science, North Carolina State University.

Source: ORCID

Added: December 6, 2019

2008 conference paper

View and index selection for query-performance improvement: quality-centered algorithms and heuristics

*Proceedings of the 17th ACM conference on Information and knowledge management*, 1329–1330.

Event: ACM

Source: ORCID

Added: December 6, 2019

2008 report

Visualizing very large layered graphs with quilts

North Carolina State University. Dept. of Computer Science.

Source: ORCID

Added: December 6, 2019

2007 journal article

A case for smaller class size with integrated lab for introductory computer science

*ACM SIGCSE Bulletin*, *39*(1), 341–345.

Source: ORCID

Added: December 6, 2019

2007 conference paper

High-contrast algorithm behavior

*Proceedings of the 2007 workshop on Experimental computer science - ExpCS '07*. Presented at the the 2007 workshop.

Event: the 2007 workshop

Sources: Crossref, NC State University Libraries

Added: March 23, 2020

2007 conference paper

High-contrast algorithm behavior: observation, hypothesis, and experimental design

*Proceedings of the 2007 workshop on Experimental computer science*, 12.

Event: ACM

Source: ORCID

Added: December 6, 2019

2007 conference paper

Proofchecker: an accessible environment for automata theory correctness proofs

*ACM SIGCSE Bulletin*, *39*(3), 48–52.

Event: ACM

Source: ORCID

Added: December 6, 2019

2007 journal article

The directional p-median problem: Definition, complexity, and algorithms

*EUROPEAN JOURNAL OF OPERATIONAL RESEARCH*, *179*(3), 1097–1108.

Contributors: L. Jackson^{ n}, G. Rouskas^{ n} & ^{ n}

author keywords: directional p-median problem; traffic quantization; vector quantization

TL;DR:
This paper treats the p-median problem under a new distance measure, the directional rectilinear distance, which requires the assigned supply point for a given demand point to lie above and to the right of it, and presents an efficient heuristic to solve it.
(via Semantic Scholar)

Sources: Web Of Science, NC State University Libraries, ORCID

Added: August 6, 2018

2007 report

View and index selection for query-performance improvement: Algorithms, heuristics and complexity

North Carolina State University. Dept. of Computer Science.

Source: ORCID

Added: December 6, 2019

2006 journal article

All-Integer Dual Simplex for Binate Cover Problems (Draft)

https://people.engr.ncsu.edu/mfms/Publications/int-dual.pdf

Source: ORCID

Added: December 6, 2019

2006 report

All-Integer Dual Simplex for Binate Cover Problems (Draft)

Source: NC State University Libraries

Added: March 23, 2020

2005 conference paper

Effective bounding techniques for solving unate and binate covering problems

*Proceedings of the 42nd annual Design Automation Conference*, 385–390.

Event: ACM

Source: ORCID

Added: December 6, 2019

2005 journal article

On SAT instance classes and a method for reliable performance experiments with SAT solvers

*Annals of Mathematics and Artificial Intelligence*, *43*(1-4), 1–34.

Sources: Crossref, NC State University Libraries

Added: March 5, 2020

2004 chapter

A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation

In *Theory and Applications of Satisfiability Testing* (Vol. 2919, pp. 53–68).

Sources: Crossref, NC State University Libraries

Added: August 6, 2018

2004 journal article

Evolutionary and alternative algorithms: reliable cost predictions for finding optimal solutions to the LABS problem

*Information Sciences*.

Source: ORCID

Added: December 6, 2019

2004 journal article

On SAT instance classes and a method for reliable performance experiments with SAT solvers

*ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE*, *43*(1-4), 1–34.

author keywords: satisfiability; conjunctive normal form; equivalence classes; experimental design; exponential and heavy-tail distributions; reliability function

TL;DR:
The proposed method not only provides a common platform for a systematic study and a reliable improvement of deterministic and stochastic SAT solvers alike but also supports the introduction and validation of new problem instance classes.
(via Semantic Scholar)

Sources: Web Of Science, NC State University Libraries

Added: August 6, 2018

2003 conference paper

A local search SAT solver using an effective switching strategy and an efficient unit propagation

*International Conference on Theory and Applications of Satisfiability Testing*, 53–68.

Event: Springer, Berlin, Heidelberg

Source: ORCID

Added: December 6, 2019

2003 journal article

Optimal one-page tree embeddings in linear time

*INFORMATION PROCESSING LETTERS*, *87*(2), 59–66.

author keywords: algorithms; optimal embedding; one-page embedding; anchored tree

TL;DR:
This work presents a linear-time algorithm for finding the optimal embedding (arrangement) in a restricted but important class of embeddings called one-page embeddeddings.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

Sources: Web Of Science, NC State University Libraries

Added: August 6, 2018

2003 conference paper

QingTing: a fast SAT solver using local search and efficient unit propagation

*Sixth International Conference on Theory and Applications of Satisfiability Testing*, *1*.

Source: ORCID

Added: December 6, 2019

2003 article

SATbed User Documentation

https://people.engr.ncsu.edu/mfms/Publications/2003-SATbed-home-guide.pdf

Source: ORCID

Added: December 6, 2019

2003 conference paper

SATbed: A Configurable Environment for Reliable Performance Experiments with SAT Instance Classes and Algorithms

*Proc. 6th Int. Conf. on Theory and Applications of Satisfiability Testing*, 5–8.

Event: Citeseer

Source: ORCID

Added: December 6, 2019

2002 journal article

New bounds on the barycenter heuristic for bipartite graph drawing

*INFORMATION PROCESSING LETTERS*, *82*(6), 293–298.

author keywords: barycenter heuristic; performance ratio; graph drawing

TL;DR:
It is shown that the performance ratio for the barycenter heuristic is still Ω( n ) even for connected bipartite graphs, and a tight constant ratio is proved for the Barycenter Heuristic on bounded-degree graphs.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

Sources: Web Of Science, NC State University Libraries

Added: August 6, 2018

2002 conference paper

The role of a skeptic agent in testing and benchmarking of SAT algorithms

*Fifth International Symposium on theTheory and Applications of Satisfiability Testing*. Presented at the Citeseer.

Event: Citeseer

Source: ORCID

Added: December 6, 2019

2001 journal article

Heuristics, experimental subjects, and treatment evaluation in bigraph crossing minimization

*Journal of Experimental Algorithmics (JEA)*, *6*, 8.

Source: ORCID

Added: December 6, 2019

2001 article

Programming and Proofs, Teaching Logic in Computer Science

https://people.engr.ncsu.edu/mfms/ProofChecker/2001-concept.pdf

Source: ORCID

Added: December 6, 2019

2000 journal article

Minimizing the complexity of an activity network

*NETWORKS*, *36*(1), 47–52.

author keywords: activity networks; network complexity index; dummy arcs; series-parallel; PERT

UN Sustainable Development Goal Categories

9. Industry, Innovation and Infrastructure
(Web of Science)

Sources: Web Of Science, NC State University Libraries

Added: August 6, 2018

1999 conference paper

Evaluating iterative improvement heuristics for bigraph crossing minimization

*ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No. 99CH36349)*, *6*, 444–447.

Event: IEEE

Source: ORCID

Added: December 6, 2019

1999 chapter

Heuristics and experimental design for bigraph crossing number minimization

In *Algorithm Engineering and Experimentation: International workshop ALENEX '99, Baltimore, MD, USA, Jan. 15-16, 1999.* (Vol. 1619, pp. 74–93).

Sources: NC State University Libraries, NC State University Libraries

Added: August 6, 2018

1996 report

Some approximation results in multicasting

Citeseer.

Source: ORCID

Added: December 6, 2019

1995 journal article

On embedding binary trees into hypercubes

*Journal of Parallel and Distributed Computing*, *24*(2), 132–138.

Source: ORCID

Added: December 6, 2019

1994 chapter

GDR: A visualization tool for graph algorithms

In *Computational Support for Discrete Mathematics* (pp. 17–28). American Mathematical Society.

Source: ORCID

Added: December 6, 2019

1993 conference paper

Fast algorithms for one-dimensionsal compaction with jog insertion

*Workshop on Algorithms and Data Structures*, 589–600.

Event: Springer, Berlin, Heidelberg

Source: ORCID

Added: December 6, 2019

1993 journal article

On counting planar embeddings

*Discrete Mathematics*, *122*(1-3), 385–392.

Source: ORCID

Added: December 6, 2019

1993 journal article

On the minimum dummy-arc problem

*RAIRO-Operations Research*, *27*, 153–168.

Source: ORCID

Added: December 6, 2019

1992 conference paper

Optimal construction of project activity networks

*Proceedings of the 1992 Annual Meeting of the Decision Sciences Institute, San Francisco*, 1424–1426.

Source: ORCID

Added: December 6, 2019

1992 journal article

Optimal reduction of two-terminal directed acyclic graphs

*SIAM Journal on Computing*, *21*(6), 1112–1129.

Source: ORCID

Added: December 6, 2019

1991 conference paper

A One-way Array Algorithm for Matroid Scheduling

*Proceedings of the third annual ACM Symposium on Parallel Algorithms and Architectures*, *21*(24), 349–356.

Source: ORCID

Added: December 6, 2019

1991 journal article

A characterization of network representable polymatroids

*Zeitschrift Für Operations Research*, *35*(4), 267–272.

Source: ORCID

Added: December 6, 2019

1991 report

Alternate characterizations of the complexity graph

Dept of Computer Science, North Carolina State University.

Source: ORCID

Added: December 6, 2019

1990 conference paper

Local search variants for hypercube embedding

*Proceedings of the Fifth Distributed Memory Computing Conference, 1990.*, *2*, 1375–1383.

Event: IEEE

Source: ORCID

Added: December 6, 2019

1990 journal article

Solving some combinatorial problems on arrays with one-way dataflow

*Algorithmica*, *5*(1-4), 179–199.

Source: ORCID

Added: December 6, 2019

1990 journal article

Unconstrained via minimization for topological multilayer routing

*IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems*, *9*(9), 970–980.

Source: ORCID

Added: December 6, 2019

1989 conference paper

Constrained planar embedding problems

*Proceedings 27th Annual Allerton Conference on Communication, Control, and Computing*, 58–67.

Source: ORCID

Added: December 7, 2019

1989 journal article

Course Outline: Course Announcement (Spring 1989) CSE/OR 691 I: Surviving Intractability

*SIGACT News*, *20*(4), 74–77.

Event: at New York, NY, USA

Source: ORCID

Added: December 7, 2019

1989 journal article

Hypercube embedding heuristics: An evaluation

*International Journal of Parallel Programming*, *18*(6), 505–549.

Source: ORCID

Added: December 6, 2019

1988 report

A one-way linear array algorithm for the median filter

North Carolina State University. Center for Communications and Signal Processing.

Source: ORCID

Added: December 6, 2019

1986 journal article

An augmenting path algorithm for linear matroid parity

*Combinatorica*, *6*(2), 123–150.

Source: ORCID

Added: December 6, 2019

1985 conference paper

Efficient algorithms for graphic matroid intersection and parity

*International Colloquium on Automata, Languages, and Programming*, 210–220.

Event: Springer, Berlin, Heidelberg

Source: ORCID

Added: December 6, 2019

1985 report

Using PQ-trees for planar embedding problems

North Carolina State University. Dept. of Computer Science.

Source: ORCID

Added: December 6, 2019

1984 conference paper

An augmenting path algorithm for the parity problem on linear matroids

*25th Annual Symposium on Foundations of Computer Science*, 217–228.

Event: IEEE

Source: ORCID

Added: December 6, 2019

1984 journal article

An augmenting path algorithm for the parity problem on linear matroids

*Combinatorica*, *6*.

Source: ORCID

Added: December 6, 2019

1983 thesis

AN AUGMENTING PATHS ALGORITHM FOR THE MATROID PARITY PROBLEM ON BINARY MATROIDS.

University of Colorado, Boulder.

Source: ORCID

Added: December 6, 2019

Updated: December 6th, 2019 15:39

1984 - present

1983 - 1984

Updated: December 5th, 2019 16:08

1979 - 1982

1977 - 1978

1971 - 1974

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.